Sciweavers

2107 search results - page 107 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
WECWIS
2003
IEEE
85views ECommerce» more  WECWIS 2003»
15 years 8 months ago
A Tractable Mechanism for Time Dependent Markets
Markets with time dependent goods are special cases of multi commodity markets.The design of large flexible markets with time dependent goods is a computational challenge. In thi...
Per Carlsson, Arne Andersson, Fredrik Ygge
AICT
2006
IEEE
130views Communications» more  AICT 2006»
15 years 5 months ago
A Search Theoretical Approach to P2P Networks: Analysis of Learning
One of the main characteristics of the peer-to-peer systems is the highly dynamic nature of the users present in the system. In such a rapidly changing enviroment, end-user guaran...
Nazif Cihan Tas, Bedri Kamil Onur Tas
CIKM
2009
Springer
15 years 10 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
133
Voted
WCNC
2008
IEEE
15 years 9 months ago
Estimation of Link Quality and Residual Time in Vehicular Ad Hoc Networks
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Nikoletta Sofra, Kin K. Leung
CG
2006
Springer
15 years 5 months ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White