1461 search results - page 164 / 293 » Complexity of Graph Covering Problems |
PODC
2009
ACM
14 years 4 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
CPAIOR
2009
Springer
14 years 4 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
CSCLP
2003
Springer
14 years 3 months ago
2003
Springer
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
ICWL
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. The paper describes a complex e-learning experiment that has involved over 700 students that attended the Human-Computer Interaction course at the "Politehnica"...