1529 search results - page 193 / 306 » Search Space Analysis of the Linear Ordering Problem |
169
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
152
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
129
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
Abstract. We study discontinuous Galerkin methods for solving elliptic variational inequalities, of both the first and second kinds. Analysis of numerous discontinuous Galerkin sch...
114
click to vote
RTCSA
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
130
click to vote
AIPS
2000
15 years 5 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...