Sciweavers

783 search results - page 102 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
VTC
2008
IEEE
179views Communications» more  VTC 2008»
14 years 3 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
HPDC
2007
IEEE
14 years 3 months ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...
ACL
1994
13 years 10 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
MP
2006
84views more  MP 2006»
13 years 8 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...