Sciweavers

8647 search results - page 732 / 1730
» The Container Selection Problem
Sort
View
ICALP
2004
Springer
16 years 25 days ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
ECAI
2000
Springer
15 years 11 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
EVOW
2010
Springer
15 years 11 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 11 months ago
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
FLAIRS
2007
15 years 9 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace