Sciweavers

2042 search results - page 115 / 409
» Variable Number of
Sort
View
CP
2005
Springer
15 years 10 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 9 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
CAV
2004
Springer
99views Hardware» more  CAV 2004»
15 years 9 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
HCI
2007
15 years 5 months ago
Context-Aware Information Agents for the Automotive Domain Using Bayesian Networks
To reduce the workload of the driver due to the increasing amount of information and functions, intelligent agents represent a promising possibility to filter the immense data sets...
Markus Ablaßmeier, Tony Poitschke, Stefan Re...
NIPS
2007
15 years 5 months ago
TrueSkill Through Time: Revisiting the History of Chess
We extend the Bayesian skill rating system TrueSkill to infer entire time series of skills of players by smoothing through time instead of filtering. The skill of each participat...
Pierre Dangauthier, Ralf Herbrich, Tom Minka, Thor...