14774 search results - page 72 / 2955 » Computational complexity and evolutionary computation |
134
click to vote
MP
2006
15 years 3 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
149
Voted
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
128
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
120
click to vote
TCS
2008
15 years 3 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
119
click to vote
IJCAI
2001
15 years 5 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...