Sciweavers

942 search results - page 51 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
FLAIRS
2007
13 years 11 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 10 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
SPATIALCOGNITION
2000
Springer
14 years 8 days ago
Modelling Navigational Knowledge by Route Graphs
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
Steffen Werner, Bernd Krieg-Brückner, Theo He...
CP
2006
Springer
14 years 13 days ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
CINQ
2004
Springer
182views Database» more  CINQ 2004»
14 years 14 days ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...