3367 search results - page 287 / 674 » Incremental assignment problem |
108
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
104
click to vote
CCGRID
2005
IEEE
15 years 10 months ago
2005
IEEE
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multip...
146
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
127
click to vote
EGC
2005
Springer
15 years 10 months ago
2005
Springer
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
126
click to vote
JIT
2004
Springer
15 years 9 months ago
2004
Springer
A software development unit called to renew or replace an existing corporate system may face some special problems in an established company with a lot of well-trained behavioral p...