Sciweavers

2088 search results - page 362 / 418
» The Probabilistic Method
Sort
View
C3S2E
2010
ACM
13 years 11 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CIKM
2009
Springer
13 years 11 months ago
Retrieval experiments using pseudo-desktop collections
Desktop search is an important part of personal information management (PIM). However, research in this area has been limited by the lack of shareable test collections, making cum...
Jinyoung Kim, W. Bruce Croft
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
SIGIR
2010
ACM
13 years 10 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
GRC
2010
IEEE
13 years 10 months ago
Geo-clustering of Images with Missing GeoTags
—Images with GPS coordinates are a rich source of information about a geographic location. Innovative user services and applications are being built using geotagged images taken ...
Vishwakarma Singh, Sharath Venkatesha, Ambuj K. Si...