3454 search results - page 286 / 691 » Modern computer algebra |
178
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
235
click to vote
AIIDE
2009
15 years 7 months ago
2009
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
205
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
202
Voted
GRID
2007
Springer
15 years 6 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
166
click to vote
SIGMETRICS
2000
ACM
15 years 6 months ago
2000
ACM
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...