Sciweavers

969 search results - page 42 / 194
» Programming as Problem Solving: A Participatory Theater Appr...
Sort
View
PLDI
2010
ACM
15 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
CP
2006
Springer
15 years 1 months ago
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
Jean-Philippe Hamiez, Jin-Kao Hao
GPCE
2005
Springer
15 years 3 months ago
FeatureC++: On the Symbiosis of Feature-Oriented and Aspect-Oriented Programming
Abstract. This paper presents FeatureC++, a novel language extension to C++ that supports Feature-Oriented Programming (FOP) and Aspect-Oriented Programming (AOP). Besides well-kno...
Sven Apel, Thomas Leich, Marko Rosenmüller, G...
IJAIT
2008
99views more  IJAIT 2008»
14 years 10 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
CP
2009
Springer
15 years 10 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...