Sciweavers

601 search results - page 57 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
133
Voted
CP
2003
Springer
15 years 6 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
142
Voted
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 1 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
CONSTRAINTS
2004
116views more  CONSTRAINTS 2004»
15 years 1 months ago
Decision Tradeoff Using Example-Critiquing and Constraint Programming
We consider constructive preference elicitation for decision aid systems in applications such as configuration or electronic catalogs. We are particularly interested in supporting ...
Pearl Pu, Boi Faltings
CP
2008
Springer
15 years 3 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 7 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee