Sciweavers

9842 search results - page 373 / 1969
» Problem complexity
Sort
View
KES
1998
Springer
15 years 11 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
WSC
2008
15 years 9 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 25 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
15 years 1 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
FGCS
2002
133views more  FGCS 2002»
15 years 6 months ago
Computational and data Grids in large-scale science and engineering
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
William E. Johnston