9842 search results - page 306 / 1969 » The Complexity of the Matching-Cut Problem |
165
click to vote
JSSPP
2005
Springer
16 years 28 days ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
232
click to vote
DATE
2003
IEEE
16 years 22 days ago
2003
IEEE
In this paper we present the results of a set of experiments we conducted in order to evaluate the viability of the behavioral synthesis, relying on the tools available at the mom...
199
click to vote
ICTAI
2003
IEEE
16 years 21 days ago
2003
IEEE
This paper presents a generic cognitive vision platform for the automatic recognition of natural complex objects. The recognition consists of three steps : image processing for nu...
188
click to vote
FAW
2009
Springer
16 years 1 days ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
201
click to vote
STACS
2009
Springer
15 years 12 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...