Sciweavers

370 search results - page 39 / 74
» Independent Sets with Domination Constraints
Sort
View
FROCOS
2011
Springer
14 years 1 months ago
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
Alberto Griggio, Quoc-Sang Phan, Roberto Sebastian...
CP
2009
Springer
16 years 2 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
RT
2000
Springer
15 years 5 months ago
Artistic Multiprojection Rendering
In composing hand-drawn images of 3D scenes, artists often alter the projection for each object in the scene independently, thereby generating multiprojection images. We present a...
Maneesh Agrawala, Denis Zorin, Tamara Munzner
SIAMCO
2000
71views more  SIAMCO 2000»
15 years 1 months ago
Any Domain of Attraction for a Linear Constrained System is a Tracking Domain of Attraction
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
Franco Blanchini, Stefano Miani
PODC
2011
ACM
14 years 4 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...