4403 search results - page 230 / 881 » Galois Theory of Algorithms |
163
Voted
SIGECOM
2005
ACM
16 years 5 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
174
click to vote
AAAI
2000
15 years 8 months ago
2000
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
321
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
222
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
149
click to vote
ICPP
2008
IEEE
16 years 1 months ago
2008
IEEE
Strategies are developed for “fattening” the tasks of computation-dags so as to accommodate the heterogeneity of remote clients in Internet-based computing (IC). Earlier work ...