Sciweavers

6894 search results - page 972 / 1379
» Generation Problems
Sort
View
TON
2010
221views more  TON 2010»
15 years 1 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
AOSD
2011
ACM
14 years 10 months ago
An aspect-oriented approach for implementing evolutionary computation applications
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
Andres J. Ramirez, Adam C. Jensen, Betty H. C. Che...
BMCBI
2011
14 years 10 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
PEPM
2011
ACM
14 years 9 months ago
Adaptation-based programming in java
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
Tim Bauer, Martin Erwig, Alan Fern, Jervis Pinto
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 9 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...