Sciweavers

2137 search results - page 343 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
116
Voted
TWC
2008
80views more  TWC 2008»
15 years 2 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
112
Voted
PASTE
2004
ACM
15 years 8 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 10 days ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
ICDT
1999
ACM
97views Database» more  ICDT 1999»
15 years 6 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
135
Voted
WINE
2007
Springer
124views Economy» more  WINE 2007»
15 years 8 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina