994 search results - page 83 / 199 » Custom Computing Machines for the Set Covering Problem |
117
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
The paper describes functionality of Magenta Multi-Agent Logistics i-Scheduler Engine presented on AAMAS 2006 conferences and gives examples of its application in business domain....
130
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
107
Voted
ASIAN
2004
Springer
15 years 6 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
119
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
101
Voted
SIGGRAPH
2000
ACM
15 years 5 months ago
2000
ACM
We approach the problem of stylistic motion synthesis by learning motion patterns from a highly varied set of motion capture sequences. Each sequence may have a distinct choreogra...