Sciweavers

1529 search results - page 138 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 10 months ago
Experimental analysis of binary differential evolution in dynamic environments
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
Alp Emre Kanlikilicer, Ali Keles, Sima Uyar
PETRA
2009
ACM
15 years 11 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICDAR
2007
IEEE
15 years 8 months ago
Google Book Search: Document Understanding on a Massive Scale
Unveiled in late 2004, Google Book Search is an ambitious program to make all the world's books discoverable online. The sheer scale of the problem brings a number of unique ...
L. Vincent
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 8 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo