1568 search results - page 126 / 314 » The problem of examination questions in algorithmics |
151
Voted
AAAI
1997
15 years 5 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
171
click to vote
QEST
2007
IEEE
15 years 10 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
133
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
128
Voted
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
108
click to vote
ICDCS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...