Sciweavers

4860 search results - page 542 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICALP
2009
Springer
16 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
CEC
2009
IEEE
15 years 11 months ago
Evolving coordinated quadruped gaits with the HyperNEAT generative encoding
— Legged robots show promise for complex mobility tasks, such as navigating rough terrain, but the design of their control software is both challenging and laborious. Traditional...
Jeff Clune, Benjamin E. Beckmann, Charles Ofria, R...
ICIP
2001
IEEE
16 years 6 months ago
Prescient mode selection for robust video coding
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
Rui Zhang, Shankar L. Regunathan, Kenneth Rose