Sciweavers

3628 search results - page 356 / 726
» The Decision Diffie-Hellman Problem
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 6 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
16 years 1 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...
SAT
2009
Springer
121views Hardware» more  SAT 2009»
16 years 1 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
GLOBECOM
2006
IEEE
16 years 24 days ago
Topology Control for Constant Rate Mobile Networks
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
16 years 8 days ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman