949 search results - page 83 / 190 » Theory of Constraints |
109
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
112
click to vote
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we present a general framework for analysis of plenoptic sampling by investigating the spectral analysis of plenoptic imaging. The proposed framework provides a uni...
100
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— This paper provides that an elastic force and an elastic potential energy due to the deformation of soft fingers, which are previously derived, can be calculated into straight...
173
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
122
Voted
NCA
2008
IEEE
15 years 21 days ago
2008
IEEE
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...