Sciweavers

536 search results - page 55 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
219
Voted
CP
2009
Springer
16 years 4 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
154
Voted
BIRTHDAY
2009
Springer
15 years 1 months ago
Management of UML Clusters
Abstract. Software engineering uses UML diagrams as a standard technique for specification and development of software. Various UML diagrams are used for specification of different...
Peggy Schmidt, Bernhard Thalheim
AIPS
2004
15 years 5 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
126
Voted
CVPR
1999
IEEE
16 years 6 months ago
A Simple Technique for Self-Calibration
This paper introduces an extension of Hartley's selfcalibration technique [8] based on properties of the essential matrix, allowing for the stable computation of varying foca...
Paulo R. S. Mendonça, Roberto Cipolla
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
15 years 1 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang