8540 search results - page 1336 / 1708 » The Dynamic Servers Problem |
142
click to vote
ECOOP
2006
Springer
15 years 6 months ago
2006
Springer
Real-time systems are notoriously difficult to design and implement, and, as many real-time problems are safety-critical, their solutions must be reliable as well as efficient and ...
170
click to vote
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
169
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
126
click to vote
ISSRE
2007
IEEE
15 years 6 months ago
2007
IEEE
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
141
click to vote
AAAI
2010
15 years 6 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...