2569 search results - page 44 / 514 » Approximate Objects and Approximate Theories |
AAAI
2010
15 years 1 days ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
JAT
2010
14 years 10 months ago
2010
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
108
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
110
click to vote
ADBIS
1994
Springer
15 years 3 months ago
1994
Springer
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...