3229 search results - page 469 / 646 » The Theory of Timed Automata |
155
click to vote
TEC
2002
15 years 6 months ago
2002
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
197
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
198
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
195
click to vote
JCC
2011
15 years 1 months ago
2011
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
199
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...