13987 search results - page 688 / 2798 » The Two Guards Problem |
198
click to vote
DGCI
2009
Springer
15 years 10 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
217
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
211
click to vote
IJCAI
2003
15 years 9 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
188
click to vote
FUIN
2008
15 years 7 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
237
click to vote
DM
2006
15 years 7 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...