Sciweavers

2907 search results - page 494 / 582
» Presentations of Structures in Admissible Sets
Sort
View
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
15 years 6 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
ICGI
2004
Springer
15 years 6 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
93
Voted
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 5 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
119
Voted
SI3D
1992
ACM
15 years 4 months ago
Volume Seedlings
Recent advances in software and hardware technology have made direct ray-traced volume rendering of 3-d scalar data a feasible and effective method for imaging of the data's ...
Michael F. Cohen, James S. Painter, Mihir Mehta, K...
112
Voted
CIDM
2009
IEEE
15 years 4 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...