Sciweavers

983 search results - page 37 / 197
» Negative-Weight Cycle Algorithms
Sort
View
NETWORKS
2010
15 years 1 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 3 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
15 years 8 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
DATE
2002
IEEE
112views Hardware» more  DATE 2002»
15 years 8 months ago
Global Optimization Applied to the Oscillator Problem
The oscillator problem consists of determining good initial values for the node voltages and the frequency of oscillation and the avoidance of the DC solution. Standard approaches...
S. Lampe, S. Laur
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 3 months ago
Coloring Meyniel graphs in linear time
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
Benjamin Lévêque, Frédé...