4117 search results - page 334 / 824 » On the Satisfiability of Complex Constraints |
183
click to vote
WWW
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...
166
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
170
click to vote
AUTOMATICA
2010
15 years 7 months ago
2010
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for swarm motion towards a goal, for biological systems to...
164
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
189
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...