Sciweavers

1002 search results - page 182 / 201
» Constraint Answer Set Solving
Sort
View
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
13 years 5 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
CVPR
2012
IEEE
13 years 3 days ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
CN
2004
150views more  CN 2004»
14 years 9 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
WWW
2003
ACM
15 years 10 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 9 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin