Sciweavers

4342 search results - page 757 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 6 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 3 months ago
Environmental robustness in multi-agent teams
Evolution has proven to be an effective method of training heterogeneous multi-agent teams of autonomous agents to explore unknown environments. Autonomous, heterogeneous agents ...
Terence Soule, Robert B. Heckendorn
ICC
2008
IEEE
163views Communications» more  ICC 2008»
14 years 3 months ago
Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Xinyu Zhang, Baochun Li
ICDE
2008
IEEE
148views Database» more  ICDE 2008»
14 years 3 months ago
Automated physical design in database caches
Abstract— Performance of proxy caches for database federations that serve a large number of users is crucially dependent on its physical design. Current techniques, automated or ...
Tanu Malik, Xiaodan Wang, Randal C. Burns, Debabra...