Sciweavers

1333 search results - page 71 / 267
» Not a Number of Floating Point Problems
Sort
View
COMPGEOM
2005
ACM
15 years 5 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
119
Voted
CEC
2007
IEEE
15 years 10 months ago
Convergence and rate of convergence of a foraging ant model
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
Amine M. Boumaza, Bruno Scherrer
111
Voted
ICML
2006
IEEE
16 years 4 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...
SOCO
2007
Springer
15 years 9 months ago
Aspect-Oriented Programming: Selecting and Exposing Object Paths
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...
125
Voted
GECCO
2004
Springer
15 years 9 months ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades