Sciweavers

1983 search results - page 110 / 397
» Competitive graph searches
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
WWW
2007
ACM
14 years 8 months ago
Review spam detection
It is now a common practice for e-commerce Web sites to enable their customers to write reviews of products that they have purchased. Such reviews provide valuable sources of info...
Nitin Jindal, Bing Liu
ATAL
2003
Springer
14 years 1 months ago
A preliminary taxonomy of multi-agent interactions
Discussions of agent interactions frequently characterize behavior as “coherent,” “collaborative,” “cooperative,” “competitive,” or “coordinated.” We propose a...
H. Van Dyke Parunak, Sven Brueckner, Mitchell Flei...
EOR
2007
133views more  EOR 2007»
13 years 7 months ago
Using genetic algorithm for dynamic and multiple criteria web-site optimizations
In today’s competitive electronic marketplace, companies try to create long-lasting relations with their online customers. Log files and registration forms generate millions of...
Arben Asllani, Alireza Lari
KR
2004
Springer
14 years 1 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner