727 search results - page 109 / 146 » Private approximation of search problems |
WWW
2005
ACM
14 years 10 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
WIOPT
2006
IEEE
14 years 3 months ago
2006
IEEE
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
AI
2001
Springer
14 years 2 months ago
2001
Springer
Reinforcement learning techniques are increasingly being used to solve di cult problems in control and combinatorial optimization with promising results. Implicit imitation can acc...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...