Sciweavers

11565 search results - page 1941 / 2313
» Computing Minimal Mappings
Sort
View
CPAIOR
2004
Springer
16 years 7 days ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
209
Voted
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
16 years 7 days ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
EUROPAR
2004
Springer
16 years 7 days ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
EUROPAR
2004
Springer
16 years 7 days ago
Scheduling Tasks Sharing Files from Distributed Repositories
Abstract. This paper is devoted to scheduling a large collection of independent tasks onto a distributed heterogeneous platform, which is composed of a set of servers. Each server ...
Arnaud Giersch, Yves Robert, Frédéri...
FMCO
2004
Springer
16 years 7 days ago
Games with Secure Equilibria
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
« Prev « First page 1941 / 2313 Last » Next »