Sciweavers

7796 search results - page 1214 / 1560
» On Generalized Schur Numbers
Sort
View
CIE
2007
Springer
16 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
ER
2007
Springer
111views Database» more  ER 2007»
16 years 1 months ago
Provability-Based Semantic Interoperability Via Translation Graphs
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
Joshua Taylor, Andrew Shilliday, Selmer Bringsjord
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
16 years 1 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
16 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 1 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley
« Prev « First page 1214 / 1560 Last » Next »