Sciweavers

4112 search results - page 95 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
COMPUTING
2006
102views more  COMPUTING 2006»
15 years 4 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
126
Voted
HM
2007
Springer
114views Optimization» more  HM 2007»
15 years 8 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss
AMC
2004
95views more  AMC 2004»
15 years 4 months ago
Optimal multigrid solutions of two-dimensional convection-conduction problems
The present work investigates the efficiency of the multigrid numerical method when used to solve two-dimensional laminar velocity and temperature fields inside a rectangular doma...
Maximilian S. Mesquita, Marcelo J. S. de Lemos
142
Voted
ICMLA
2009
15 years 1 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
AAAI
1994
15 years 5 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex