Sciweavers

1453 search results - page 96 / 291
» Partial Constraint Satisfaction
Sort
View
198
Voted
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 10 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
ISIPTA
2005
IEEE
146views Mathematics» more  ISIPTA 2005»
15 years 9 months ago
Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
Jianzhong Zhang 0004, Daniel Berleant
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 10 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
WIOPT
2011
IEEE
14 years 7 months ago
Portfolio optimization in secondary spectrum markets
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
Praveen Kumar Muthuswamy, Koushik Kar, Aparna Gupt...
133
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 4 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný