Sciweavers

2899 search results - page 318 / 580
» Dynamic Trees in Practice
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 5 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
132
Voted
EMNLP
2004
15 years 5 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
WSC
2001
15 years 5 months ago
A virtual environment for simulating manufacturing operations in 3D
This paper presents a method for simulating basic manufacturing operations (unload, load, process, move, and store) in a 3D virtual environment. The virtual environment provides a...
Ravi Chawla, Amarnath Banerjee
158
Voted
ICGA
1993
145views Optimization» more  ICGA 1993»
15 years 5 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ANOR
2008
171views more  ANOR 2008»
15 years 4 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet