Sciweavers

7430 search results - page 458 / 1486
» Programming Applications in CIFF
Sort
View
189
Voted
ANOR
2011
96views more  ANOR 2011»
15 years 1 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
218
Voted
SCP
2010
123views more  SCP 2010»
15 years 1 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
227
Voted
CPAIOR
2011
Springer
14 years 10 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
ICALP
2011
Springer
14 years 10 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
253
Voted
PEPM
2011
ACM
14 years 9 months ago
Allocation removal by partial evaluation in a tracing JIT
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
Carl Friedrich Bolz, Antonio Cuni, Maciej FijaBkow...