Sciweavers

248 search results - page 18 / 50
» The Multi-Story Space Assignment Problem
Sort
View
AAAI
2004
13 years 11 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CVPR
2012
IEEE
12 years 7 days ago
Improving multi-target tracking via social grouping
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...
Zhen Qin, Christian R. Shelton
PACT
1999
Springer
14 years 2 months ago
Parallel Implementation of Constraint Solving
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
Alvaro Ruiz-Andino, Lourdes Araujo, Fernando S&aac...
DSRT
2008
IEEE
14 years 4 months ago
A Dynamic Area of Interest Management and Collaboration Model for P2P MMOGs
In this paper, we present a dynamic area of interest management for Massively Multiplayer Online Games (MMOG). Instead of mapping the virtual space to the area of interest (AOI), ...
Dewan Tanvir Ahmed, Shervin Shirmohammadi