Sciweavers

1559 search results - page 31 / 312
» Some Group Theory Problems
Sort
View
ICALP
1998
Springer
15 years 1 months ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin
92
Voted
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
14 years 10 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
SOCO
2008
Springer
14 years 9 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima
82
Voted
ICC
2008
IEEE
137views Communications» more  ICC 2008»
15 years 4 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
SYNTHESE
2008
69views more  SYNTHESE 2008»
14 years 9 months ago
Dispositional implementation solves the superfluous structure problem
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
Colin Klein