9325 search results - page 353 / 1865 » The decentralized implementability problem |
152
click to vote
TIP
2008
15 years 4 months ago
2008
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
149
Voted
COMPSAC
2011
IEEE
14 years 4 months ago
2011
IEEE
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
148
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
145
click to vote
CP
1998
Springer
15 years 9 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
146
click to vote
AIPS
2006
15 years 6 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...