Sciweavers

7092 search results - page 454 / 1419
» Parallelizing constraint programs
Sort
View
139
Voted
AIPS
2004
15 years 5 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
148
Voted
IPPS
2002
IEEE
15 years 8 months ago
Characterizing NAS Benchmark Performance on Shared Heterogeneous Networks
The goal of this research is to develop performance profiles of parallel and distributed applications in order to predict their execution time under different network conditions....
Jaspal Subhlok, Shreenivasa Venkataramaiah, Amitoj...
159
Voted
MATES
2009
Springer
15 years 10 months ago
GOAL as a Planning Formalism
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...
Koen V. Hindriks, Tijmen Roberti
141
Voted
FMOODS
2008
15 years 5 months ago
Termination Analysis of Java Bytecode
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
Elvira Albert, Puri Arenas, Michael Codish, Samir ...
123
Voted
HPCA
2008
IEEE
16 years 4 months ago
Fundamental performance constraints in horizontal fusion of in-order cores
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...
Pierre Salverda, Craig B. Zilles