Sciweavers

499 search results - page 53 / 100
» Decision Trees for Functional Variables
Sort
View
IJCAI
2007
13 years 9 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
Jérôme Lang
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 7 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
CN
2008
127views more  CN 2008»
13 years 7 months ago
Decentralized detection of global threshold crossings using aggregation trees
The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of ...
Fetahi Wuhib, Mads Dam, Rolf Stadler
EOR
2006
90views more  EOR 2006»
13 years 7 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu