3653 search results - page 170 / 731 » On Recognizable Timed Languages |
141
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
147
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
160
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
148
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper describes a generic mechanism to migrate threads in heterogeneous distributed environments. To maintain high portability and flexibility, thread migration is implement...
144
click to vote
ICANN
2001
Springer
15 years 9 months ago
2001
Springer
This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the c...