1224 search results - page 138 / 245 » Theory decision by decomposition |
113
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
126
click to vote
MICRO
2005
IEEE
15 years 6 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
126
Voted
SAC
2004
ACM
15 years 6 months ago
2004
ACM
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
100
Voted
INFOCOM
1998
IEEE
15 years 5 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
109
Voted
ISCI
2008
15 years 24 days ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...