Sciweavers

9842 search results - page 405 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
145
Voted
VLDB
1990
ACM
101views Database» more  VLDB 1990»
15 years 8 months ago
Non-Monotonic Knowledge Evolution in VLKDBs
Non-monotonic knowledge evolutions and exceptions constitute a complex theoritical and practical problem. The state of the art shows a rich and surprising diversity of approaches....
Christian Esculier
PPSN
1998
Springer
15 years 8 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...
PPSN
2000
Springer
15 years 8 months ago
Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
Márk Jelasity
154
Voted
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 7 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
COCOA
2008
Springer
15 years 6 months ago
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
Rhonda Chaytor, Patricia A. Evans, Todd Wareham