Sciweavers

15033 search results - page 276 / 3007
» Complexity Theory and Algorithms
Sort
View
IJCAI
2003
15 years 6 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
140
Voted
IJCBDD
2010
127views more  IJCBDD 2010»
15 years 3 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
RTS
2002
177views more  RTS 2002»
15 years 4 months ago
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms
This paper presents a Feedback Control real-time Scheduling (FCS) framework for adaptive realtime systems. An advantage of the FCS framework is its use of feedback control theory ...
Chenyang Lu, John A. Stankovic, Sang Hyuk Son, Gan...

Presentation
1554views
17 years 4 months ago
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources, Poster Presentation at Microsoft TechVista Delhi. (October 2007)
Sujit Gujar, Rama Suri Narayanam, Y Narahari
153
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 11 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii