Sciweavers

2526 search results - page 248 / 506
» A New Algorithm for Answer Set Computation
Sort
View
AI
2003
Springer
15 years 11 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ICDCS
2002
IEEE
15 years 11 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
ICML
2009
IEEE
16 years 7 months ago
Discriminative k-metrics
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
Arthur Szlam, Guillermo Sapiro
ICPR
2000
IEEE
15 years 11 months ago
Maximum Likelihood Stereo Matching
In the research literature, maximum likelihood principles were applied to stereo matching by altering the stereo pair so that the difference would have a Gaussian distribution. He...
Nicu Sebe, Michael S. Lew