Searched for:
(21 - 40 of 58)

Pages

document
Oosterman, J.E.G. (author), Ravenhorst, R. (author), Witteveen, C. (author), Van Leeuwen, P. (author)
At airports, the turnaround process of aircraft is crucial for a timely and efficient handling of air traffic. During this process, a number of services need to be provided during the time the aircraft is at the gate: e.g., de-boarding, cleaning, catering, fuelling, and boarding. These services are provided by different service providers (agents...
conference paper 2008
document
Narasimha, C.Y. (author), Witteveen, C. (author), Zhang, Y. (author), Wu, M. (author), La Poutré, H. (author)
conference paper 2008
document
Verwer, S. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
conference paper 2008
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We describe an efficient algorithm for learning deterministic real-time automata (DRTA) from positive data. This data can be obtained from observations of the process to be modeled. The DRTA model we learn from such data can be used reason and gain knowledge about realtime systems such as network protocols, business processes, reactive systems,...
conference paper 2008
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
This paper describes an efficient algorithm for learning a timed model from observations. The algorithm is based on the state merging method for learning a deterministic finite state automaton (DFA). This method and its problem have been the subject of many studies within the grammatical inference field, see e.g. (de la Higuera, 2005)....
conference paper 2008
document
Witteveen, J.A.S. (author), Bijl, H. (author)
conference paper 2008
document
Witteveen, J.A.S. (author)
conference paper 2008
document
Witteveen, J.A.S. (author), Bijl, H. (author)
conference paper 2008
document
Witteveen, J.A.S. (author), Bijl, H. (author)
conference paper 2008
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of this model is that it can be interpreted by domain experts. When observing a real-world system, however, there often is more information than just the sequence of discrete events: the time at which these events occur may be very important. In...
conference paper 2007
document
Steenhuisen, J.R. (author), Witteveen, C. (author)
conference paper 2007
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We describe an algorithm for learning simple timed automata, known as real-time automata. The transitions of real-time automata can have a temporal constraint on the time of occurrence of the current symbol relative to the previous symbol. The learning algorithm is similar to the redblue fringe state-merging algorithm for the problem of learning...
conference paper 2007
document
Steenhuisen, J.R. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
In crisis response, hierarchical organizations are being replaced by dynamic assemblies of autonomous agents that promise more agility. However, these autonomous agents might cause a decrease in effectiveness when individually constructed plans for moderately-coupled tasks are not jointly feasible. Existing coordination techniques can be applied...
conference paper 2007
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We are interested in identifying a model for discrete event systems from observations. A common way to model discrete event systems is by using deterministic finite state automata (DFA). When observing a system, however, there often is information in addition to the system events, namely, their times of occurrence. If this time information is...
conference paper 2006
document
Buzing, P.C. (author), Steenhuisen, J.R. (author), Witteveen, C. (author)
We address the problem of coordinating autonomous agents that have to come up with a joint plan and schedule for a set of tasks. These tasks are interdependent and temporally constrained and are distributed over the agents. We start with investigating the scheduling part of the problem: How to achieve, given the constraints, a joint solution to...
conference paper 2006
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
In our paper we focus on learning systems of which the execution is determined by a finite set of discrete events. The full version of this paper appeared in: Proceedings of the 15th Annual Machine Learning Conference of Belgium and the Netherlands (Benelearn 2006): http://resolver.tudelft.nl/uuid:faab7982-46bf-4d52-8a2a-324a88542584
conference paper 2006
document
Mao, X. (author), Ter Mors, A.W. (author), Roos, N. (author), Witteveen, C. (author)
The planning and scheduling of the deicing and anti-icing activities is an important and challenging part of airport departure planning. Deicing planning has to be done in a highly dynamic environment involving several autonomous and self-interested parties. Traditional centralized scheduling approaches do not acknowledge the autonomy of parties...
conference paper 2006
document
Witteveen, J.A.S. (author), Bijl, H. (author)
A monomial chaos approach is proposed for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can still be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear equations which can be coupled. The proposed...
conference paper 2006
document
Loeven, A. (author), Witteveen, J.A.S. (author), Bijl, H. (author)
In this paper a Two Step approach with Chaos Collocation for efficient uncertainty quantification in computational fluid-structure interactions is followed. In Step I, a Sensitivity Analysis is used to efficiently narrow the problem down from multiple uncertain parameters to one parameter which has the largest influence on the solution. In Step...
conference paper 2006
document
Witteveen, J.A.S. (author), Bijl, H. (author)
A monomial chaos approach is proposed for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can still be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear equations which can be coupled. The proposed...
conference paper 2006
Searched for:
(21 - 40 of 58)

Pages