Sciweavers

132 search results - page 5 / 27
» A Simple Test for Interval Graphs
Sort
View
IJFCS
2007
93views more  IJFCS 2007»
14 years 10 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
OOPSLA
2010
Springer
14 years 8 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
PPSN
2004
Springer
15 years 3 months ago
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
JSS
2011
126views more  JSS 2011»
14 years 25 days ago
A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems
Forecasting workflow activity durations is of great importance to support satisfactory QoS in workflow systems. Traditionally, a workflow system is often designed to facilitate the...
Xiao Liu, Zhiwei Ni, Dong Yuan, Yuan-Chun Jiang, Z...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 10 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo