Sciweavers

1046 search results - page 58 / 210
» Approximation Algorithms for Domination Search
Sort
View
EACL
2009
ACL Anthology
16 years 1 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
112
Voted
HPCC
2007
Springer
15 years 6 months ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
114
Voted
ICDCS
2006
IEEE
15 years 6 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
142
Voted
TKDE
2010
160views more  TKDE 2010»
14 years 10 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
90
Voted
HIS
2007
15 years 1 months ago
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
Crina Grosan, Ajith Abraham