Sciweavers

573 search results - page 113 / 115
» Planning as Satisfiability with Preferences
Sort
View
USENIX
2007
13 years 10 months ago
Load Shedding in Network Monitoring Applications
Monitoring and mining real-time network data streams is crucial for managing and operating data networks. The information that network operators desire to extract from the network...
Pere Barlet-Ros, Gianluca Iannaccone, Josep Sanju&...
HYBRID
2010
Springer
13 years 9 months ago
Receding horizon control for temporal logic specifications
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
Tichakorn Wongpiromsarn, Ufuk Topcu, Richard M. Mu...
RSS
2007
119views Robotics» more  RSS 2007»
13 years 9 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit
COR
2006
82views more  COR 2006»
13 years 7 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya