549 search results - page 38 / 110 » On the Complexity of Restricted k-anonymity Problem |
121
Voted
CORR
2012
Springer
13 years 9 months ago
2012
Springer
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
124
click to vote
AI
1998
Springer
15 years 1 months ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
132
click to vote
AAAI
2006
15 years 3 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
114
click to vote
TMC
2008
15 years 1 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
103
click to vote
MST
2010
15 years 11 days ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...