Sciweavers

920 search results - page 18 / 184
» Generating Satisfiable Problem Instances
Sort
View
CIARP
2007
Springer
14 years 1 months ago
Image Segmentation Using Automatic Seeded Region Growing and Instance-Based Learning
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...
Octavio Gómez, Jesús A. Gonzá...
HM
2010
Springer
146views Optimization» more  HM 2010»
13 years 7 months ago
An Improved Memetic Algorithm for Break Scheduling
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...
Magdalena Widl, Nysret Musliu
ECML
2005
Springer
14 years 1 months ago
Machine Learning of Plan Robustness Knowledge About Instances
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...
Sergio Jiménez, Fernando Fernández, ...
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
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...
Peyman Afshani, Jérémy Barbay, Timot...
VLSID
2009
IEEE
142views VLSI» more  VLSID 2009»
14 years 8 months ago
Floorplanning for Partial Reconfiguration in FPGAs
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...
Pritha Banerjee, Megha Sangtani, Susmita Sur-Kolay