Sciweavers

2553 search results - page 408 / 511
» Modeling Trees with Hypertextures
Sort
View
129
Voted
CONSTRAINTS
2006
70views more  CONSTRAINTS 2006»
15 years 3 months ago
Stochastic Constraint Programming: A Scenario-Based Approach
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs conta...
Armagan Tarim, Suresh Manandhar, Toby Walsh
148
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
152
Voted
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 3 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
113
Voted
JSYML
2008
63views more  JSYML 2008»
15 years 3 months ago
Classifying model-theoretic properties
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
Chris J. Conidis
115
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 3 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite