Sciweavers

269 search results - page 21 / 54
» Complexity Theory Made Easy
Sort
View
IJCAI
1989
13 years 9 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
13 years 7 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 2 months ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 9 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
MOBIHOC
2008
ACM
14 years 8 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li