Sciweavers

7106 search results - page 331 / 1422
» Restricted Complexity, General Complexity
Sort
View
130
Voted
INFORMATICALT
2007
95views more  INFORMATICALT 2007»
15 years 4 months ago
Neuro-IG: A Hybrid System for Selection and Elimination of Predictor Variables and non Relevant Individuals
In this article we present the general architecture of a hybrid neuro-symbolic system for the selection and stepwise elimination of predictor variables and non-relevant individuals...
Baghdad Atmani, Bouziane Beldjilali
ISPW
2010
IEEE
15 years 9 months ago
Software Factories: Describing the Assembly Process
Software Factories pose a paradigm shift that promises to turn application assembly more cost eective through systematic reuse. These advances in software industrialization have h...
Maider Azanza, Oscar Díaz, Salvador Trujill...
102
Voted
CORR
2007
Springer
83views Education» more  CORR 2007»
15 years 4 months ago
Time and the Prisoner's Dilemma
B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....
Yishay Mor, Jeffrey S. Rosenschein
MST
2010
117views more  MST 2010»
14 years 11 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
LICS
2012
IEEE
13 years 7 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard