Sciweavers

4843 search results - page 183 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
NIPS
2004
15 years 4 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
IJCAI
1989
15 years 4 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
CCCG
2009
15 years 4 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 3 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
AUTOMATICA
2006
76views more  AUTOMATICA 2006»
15 years 3 months ago
Nonlinear robust performance analysis using complex-step gradient approximation
In this paper, the complex-step method is applied in the setting of numerical optimisation problems involving dynamical systems modelled as nonlinear differential equations. The m...
Jongrae Kim, Declan G. Bates, Ian Postlethwaite