Sciweavers

9842 search results - page 1755 / 1969
» Problem complexity
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 3 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
RECOMB
2006
Springer
16 years 6 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
16 years 21 days ago
Genetic optimization for yacht design
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
Paolo Geremia, Mauro Poian, Silvia Poles
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
16 years 21 days ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
AWIC
2003
Springer
15 years 11 months ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh
« Prev « First page 1755 / 1969 Last » Next »