Sciweavers

890 search results - page 161 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
15 years 7 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
MASCOTS
2003
15 years 3 months ago
Using User Interface Event Information in Dynamic Voltage Scaling Algorithms
Increasingly, mobile computers use dynamic voltage scaling (DVS) to reduce CPU voltage and speed and thereby increase battery life. To determine how to change voltage and speed wh...
Jacob R. Lorch, Alan Jay Smith
AI
2010
Springer
15 years 1 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
CN
2007
91views more  CN 2007»
15 years 1 months ago
On investigating overlay service topologies
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality of Service (QoS), secur...
Zhi Li, Prasant Mohapatra
ICWSM
2009
14 years 11 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...