15033 search results - page 182 / 3007 » Complexity Theory and Algorithms |
120
click to vote
IANDC
1998
15 years 3 months ago
1998
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
130
Voted
CSB
2005
IEEE
15 years 9 months ago
2005
IEEE
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
142
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
148
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
134
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...