Sciweavers

1940 search results - page 254 / 388
» Optimizing search engines using clickthrough data
Sort
View
133
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
EUROPAR
2006
Springer
15 years 8 months ago
Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems
Abstract. In peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal replication is attained...
Elias Leontiadis, Vassilios V. Dimakopoulos, Evagg...
GEOINFO
2003
15 years 6 months ago
Planning Brazilian Urban Traffic with a Geographic Application Software
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
Juliano Lopes de Oliveira, André Constantin...
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 5 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
ISSTA
1998
ACM
15 years 9 months ago
Computation of Interprocedural Control Dependence
Program dependence information is useful for a variety of software testing and maintenance tasks. Properly defined, control and data dependencies can be used to identify semantic...
Mary Jean Harrold, Gregg Rothermel, Saurabh Sinha