19130 search results - page 145 / 3826 » Modelling multi-path problems |
142
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
151
click to vote
CP
2007
Springer
16 years 18 days ago
2007
Springer
Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However,...
162
click to vote
ESA
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
169
click to vote
SARA
2007
Springer
16 years 16 days ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
154
click to vote
DSN
2006
IEEE
16 years 15 days ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...