2168 search results - page 210 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
143
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
149
Voted
FPL
2000
Springer
15 years 8 months ago
2000
Springer
Coarse-grain reconfigurable architectures have been a matter of intense research in the last few years. They promise to be more adequate for computational tasks due to their better...
158
click to vote
AAAI
1998
15 years 6 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
130
Voted
SIAMDM
2008
15 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
107
click to vote
GRAPHITE
2003
ACM
15 years 9 months ago
2003
ACM
An inexpensive computer input device was developed that allows the user to operate within both 2D and 3D environments by simply moving and rotating their fist. Position and rotati...