Sciweavers

12519 search results - page 146 / 2504
» Approximation Problems Categories
Sort
View
ALGORITHMICA
2006
93views more  ALGORITHMICA 2006»
15 years 6 months ago
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
Ashish Goel, Adam Meyerson
POPL
2003
ACM
16 years 6 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili
ATAL
2007
Springer
16 years 17 days ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
RT
2004
Springer
15 years 11 months ago
Anti-aliasing and Continuity with Trapezoidal Shadow Maps
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
Tobias Martin, Tiow Seng Tan
JUCS
2010
142views more  JUCS 2010»
15 years 4 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima