789 search results - page 82 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
128
click to vote
HIPC
2007
Springer
15 years 9 months ago
2007
Springer
- With the increased complexity of platforms coupled with data centers’ servers sprawl, power consumption is reaching unsustainable limits. Memory is an important target for plat...
126
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
117
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
114
click to vote
AAAI
2000
15 years 4 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
122
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...