Sciweavers

1968 search results - page 326 / 394
» The Complexity of Valued Constraint Models
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
SIGSOFT
2007
ACM
15 years 10 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 4 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
MSWIM
2005
ACM
15 years 3 months ago
Adaptive transmission opportunity with admission control for IEEE 802.11e networks
The increase of IEEE 802.11’s bandwidth led to a deployment of many multimedia applications over wireless networks. Nevertheless, these applications impose stringent constraints...
Adlen Ksentini, Abdelhak Guéroui, Mohamed N...
ISAAC
2003
Springer
85views Algorithms» more  ISAAC 2003»
15 years 3 months ago
Geometric Restrictions on Producible Polygonal Protein Chains
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
Erik D. Demaine, Stefan Langerman, Joseph O'Rourke