15485 search results - page 2739 / 3097 » Computing Optimal Subsets |
181
Voted
LOPSTR
2004
Springer
16 years 3 days ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
195
click to vote
MFCS
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
208
click to vote
NOSSDAV
2004
Springer
16 years 3 days ago
2004
Springer
We are developing a distributed architecture for massivelymultiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this archi...
175
click to vote
NOSSDAV
2004
Springer
16 years 3 days ago
2004
Springer
— We present the design, implementation, and performance evaluation of AMPS — a flexible, scalable proxy testbed that supports a wide and extensible set of next-generation pro...
183
click to vote
NPC
2004
Springer
16 years 3 days ago
2004
Springer
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...