Sciweavers

3775 search results - page 277 / 755
» The Expression Problem Revisited
Sort
View
ICCD
2004
IEEE
105views Hardware» more  ICCD 2004»
16 years 3 months ago
Circuit-Based Preprocessing of ILP and Its Applications in Leakage Minimization and Power Estimation
In this paper we discuss the application of circuit-based logical reasoning to simplify optimization problems expressed as integer linear programs (ILP) over circuit states. We de...
Donald Chai, Andreas Kuehlmann
CPAIOR
2009
Springer
16 years 1 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
QEST
2008
IEEE
16 years 1 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...