566 search results - page 48 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
102
Voted
AUTOMATICA
1999
15 years 4 days ago
1999
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
104
click to vote
SMA
2006
ACM
15 years 6 months ago
2006
ACM
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
91
Voted
AIPS
2000
15 years 1 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
114
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Transmit-power control is a critical task in cognitive radio (CR) networks. In the present contribution, adherence to hierarchies between primary and secondary users in a peer-to-...
109
click to vote
CONEXT
2010
ACM
14 years 10 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...