Sciweavers

496 search results - page 90 / 100
» WSD as a Distributed Constraint Optimization Problem
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
Static scheduling of dependent parallel tasks on heterogeneous clusters
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
JAIR
2008
110views more  JAIR 2008»
13 years 7 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
TMC
2008
146views more  TMC 2008»
13 years 7 months ago
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
In multihop wireless sensor networks that are often characterized by many-to-one (convergecast) traffic patterns, problems related to energy imbalance among sensors often appear. S...
Zhao Cheng, Mark A. Perillo, Wendi B. Heinzelman
SBACPAD
2008
IEEE
206views Hardware» more  SBACPAD 2008»
14 years 2 months ago
A High Performance Massively Parallel Approach for Real Time Deformable Body Physics Simulation
Single processor technology has been evolving across last decades, but due to physical limitations of chip manufacturing process, the industry is pursuing alternatives to sustain ...
Thiago S. M. C. de Farias, Mozart W. S. Almeida, J...
NPC
2004
Springer
14 years 28 days ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
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...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...