Sciweavers

3475 search results - page 227 / 695
» Backbones in Optimization and Approximation
Sort
View
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
16 years 20 days ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
ISAAC
2007
Springer
93views Algorithms» more  ISAAC 2007»
16 years 19 days ago
Dilation-Optimal Edge Deletion in Polygonal Cycles
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 18 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
PPDP
2005
Springer
15 years 12 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 11 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...