952 search results - page 171 / 191 » Computational complexity of stochastic programming problems |
117
click to vote
MEMOCODE
2006
IEEE
15 years 8 months ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
104
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
101
Voted
WPES
2003
ACM
15 years 7 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
103
click to vote
ALT
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
151
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...