Sciweavers

13987 search results - page 403 / 2798
» The Two Guards Problem
Sort
View
168
Voted
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 11 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
IAT
2009
IEEE
15 years 10 months ago
On-line Coordination: Event Interaction and State Communication between Cooperative Agents
This paper addresses a novel coordination problem for distributed agents in a discrete-event setting. We introduce and study a predicate coordination problem as the problem of dist...
Manh Tung Pham, Kiam Tian Seow
181
Voted
CGI
2004
IEEE
15 years 10 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 10 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
Ingo Oesterreicher, Andreas Mitschele, Frank Schlo...