Sciweavers

397 search results - page 39 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 5 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
ICCAD
2003
IEEE
210views Hardware» more  ICCAD 2003»
14 years 4 months ago
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
Energy consumption is an important performance parameter for portable and wireless embedded systems. However, energy consumption must be carefully balanced with real-time responsi...
Vishnu Swaminathan, Krishnendu Chakrabarty
SPIRE
2007
Springer
14 years 1 months ago
Generalized LCS
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva ...
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 6 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...