4110 search results - page 811 / 822 » Efficient algorithms for the 2-gathering problem |
POPL
2005
ACM
14 years 7 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
SIGMOD
2007
ACM
14 years 6 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
MOBIHOC
2007
ACM
14 years 6 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...