13987 search results - page 287 / 2798 » The Two Guards Problem |
137
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
143
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
140
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
138
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
139
click to vote
DAM
2008
15 years 4 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...