2543 search results - page 264 / 509 » Optimal Ordered Problem Solver |
145
click to vote
JTRES
2010
ACM
15 years 3 months ago
2010
ACM
Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. I...
124
click to vote
ARSCOM
2007
15 years 3 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
104
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
110
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
128
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...