654 search results - page 51 / 131 » Ordered Sets and Complete Lattices |
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
JAPLL
2006
13 years 7 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
VISUALIZATION
2003
IEEE
14 years 28 days ago
2003
IEEE
We introduce a method for the animation of fire propagation and the burning consumption of objects represented as volumetric data sets. Our method uses a volumetric fire propaga...