Sciweavers

241 search results - page 47 / 49
» Constraint Handling in Genetic Algorithms: The Set Partition...
Sort
View
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
CSDA
2008
128views more  CSDA 2008»
13 years 7 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
ICN
2005
Springer
14 years 1 months ago
Information Fusion for Data Dissemination in Self-Organizing Wireless Sensor Networks
Data dissemination is a fundamental task in wireless sensor networks. Because of the radios range limitation and energy consumption constraints, sensor data is commonly disseminate...
Eduardo Freire Nakamura, Carlos Mauricio S. Figuei...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 10 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
DAC
2007
ACM
14 years 8 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu