920 search results - page 18 / 184 » Generating Satisfiable Problem Instances |
100
Voted
CIARP
2007
Springer
15 years 7 months ago
2007
Springer
Segmentation through seeded region growing is widely used because it is fast, robust and free of tuning parameters. However, the seeded region growing algorithm requires an automat...
106
click to vote
HM
2010
Springer
15 years 29 days ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
103
click to vote
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...
104
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
79
Voted
VLSID
2009
IEEE
16 years 1 months ago
2009
IEEE
Partial Reconfiguration on heterogeneous Field Programmable Gate Arrays (FPGA) with millions of gates yields better utilization of resources by swapping in and out the active modu...