6456 search results - page 47 / 1292 » Constraint Solving on Terms |
111
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
121
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
102
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
82
Voted
FLAIRS
2003
15 years 2 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
103
Voted
NIPS
2001
15 years 2 months ago
2001
This paper presents reinforcement learning with a Long ShortTerm Memory recurrent neural network: RL-LSTM. Model-free RL-LSTM using Advantage learning and directed exploration can...