Sciweavers

2612 search results - page 436 / 523
» Switching Graphs and Their Complexity
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 10 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
BMCBI
2006
195views more  BMCBI 2006»
13 years 10 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
IJSI
2008
91views more  IJSI 2008»
13 years 10 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
RE
2006
Springer
13 years 10 months ago
Interaction Analysis in Aspect-Oriented Models
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
Katharina Mehner, Mattia Monga, Gabriele Taentzer
JCSS
2000
121views more  JCSS 2000»
13 years 9 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...