1629 search results - page 281 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
DAC
2007
ACM
15 years 10 months ago
2007
ACM
The ability to account for the growing impacts of multiple process variations in modern technologies is becoming an integral part of nanometer VLSI design. Under the context of ti...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
113
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
100
click to vote
EMSOFT
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...