4679 search results - page 519 / 936 » Modeling When Connections Are the Problem |
185
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
158
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
An increasing interest in the soft hashing problem has been witnessed in recent times. Techniques implementing soft hashing intend to mirror the behaviour of cryptographic hashing...
160
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In the sponsored search model, search engines are paid by businesses that are interested in displaying ads for their site alongside the search results. Businesses bid for keywords...
185
click to vote
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
196
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...