Sciweavers

244 search results - page 43 / 49
» On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Sort
View
QSHINE
2005
IEEE
14 years 1 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
RTCSA
2005
IEEE
14 years 1 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
NETGAMES
2005
ACM
14 years 1 months ago
FreeRank: implementing independent ranking service for multiplayer online games
Ranking is necessary for multiplayer online games to provide players with self-complacence and reference for choosing game counterparts. Most existing ranking solutions are tightl...
Li Tang, Jun Li, Jin Zhou, Zhizhi Zhou, Hao Wang, ...
ISMDA
2005
Springer
14 years 1 months ago
Simultaneous Scheduling of Replication and Computation for Bioinformatic Applications on the Grid
Abstract. One of the first motivations of using grids comes from applications managing large data sets like for example in High Energy Physic or Life Sciences. To improve the glob...
Frederic Desprez, Antoine Vernois, Christophe Blan...
WSNA
2003
ACM
14 years 1 months ago
Information-directed routing in ad hoc sensor networks
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
Juan Liu, Feng Zhao, Dragan Petrovic