6575 search results - page 98 / 1315 » Specializing visualization algorithms |
118
Voted
IJCAI
2001
15 years 4 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
112
Voted
CCGRID
2005
IEEE
15 years 8 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
116
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
234
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
105
Voted
IJCAI
2001
15 years 4 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...