148 search results - page 12 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Widespread emergence of multicore processors will spur development of parallel applications, exposing programmers to degrees of hardware concurrency hitherto unavailable...
CP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
PPOPP
1993
ACM
13 years 11 months ago
1993
ACM
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...