2607 search results - page 268 / 522 » Complete Functional Synthesis |
147
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
133
click to vote
RE
2006
Springer
15 years 4 months ago
2006
Springer
Domain knowledge is one of crucial factors to get a great success in requirements elicitation of high quality, and only domain experts, not requirements analysts, have it. We prop...
144
click to vote
AMAI
2004
Springer
15 years 4 months ago
2004
Springer
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
120
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
124
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...