Sciweavers

243 search results - page 23 / 49
» Extending the mirror neuron system model, I
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 1 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
APCCM
2006
13 years 9 months ago
Process modelling: the deontic way
Current enterprise systems rely heavily on the modelling and enactment of business processes. One of the key criteria for a business process is to represent not just the behaviour...
Vineet Padmanabhan, Guido Governatori, Shazia Wasi...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 1 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
ATAL
2007
Springer
14 years 1 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...