Sciweavers

9842 search results - page 450 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
266
Voted
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 11 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
DEXA
1998
Springer
98views Database» more  DEXA 1998»
15 years 11 months ago
Browsing SGML Documents with Maps: The French "Inventaire" Experience
For GIS, SGML document servers and other highly specialized application domains, the systems integration problem is essential since the available software often is complex and wou...
Bernd Amann, Dan Vodislav, Julio Fernandes, George...
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 11 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
ASPDAC
2004
ACM
144views Hardware» more  ASPDAC 2004»
15 years 11 months ago
Verification of timed circuits with symbolic delays
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
Robert Clarisó, Jordi Cortadella
APNOMS
2006
Springer
15 years 11 months ago
Hybrid Inference Architecture and Model for Self-healing System
Distributed computing systems are continuously increasing in complexity and cost of managing, and system management tasks require significantly higher levels of autonomic managemen...
Giljong Yoo, Jeongmin Park, Eunseok Lee