Sciweavers

7047 search results - page 413 / 1410
» Focusing on Binding and Computation
Sort
View
ECCC
2006
71views more  ECCC 2006»
15 years 6 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
CAD
2007
Springer
15 years 6 months ago
A formal theory for estimating defeaturing-induced engineering analysis errors
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
Sankara Hari Gopalakrishnan, Krishnan Suresh
IS
2006
15 years 6 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
NCA
2008
IEEE
15 years 6 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
CAD
2005
Springer
15 years 6 months ago
Drawing curves onto a cloud of points for point-based modelling
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...
Phillip N. Azariadis, Nickolas S. Sapidis