Sciweavers

2412 search results - page 148 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
151
Voted
FOCS
1995
IEEE
15 years 7 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ICCAD
1998
IEEE
143views Hardware» more  ICCAD 1998»
15 years 7 months ago
Real-time operating systems for embedded computing
We survey the state-of-the-art in real-time operating systems (RTOSs) from the system synthesis point of view. RTOSs have a very long research history which provides important the...
Serge Hustin, Miodrag Potkonjak, Eric Verhulst, Wa...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 7 months ago
Evolving kernels for support vector machine classification
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...
Keith Sullivan, Sean Luke
162
Voted
ALT
2002
Springer
16 years 12 days ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 8 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...