1058 search results - page 97 / 212 » It's Doomed; We Can Prove It |
105
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
89
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
116
Voted
IANDC
2010
14 years 11 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
95
Voted
ICAC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Reactive systems are those that maintain an ongoing interaction with their environment at a speed dictated by the latter. Examples of such systems include web servers, network ...
80
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...