Sciweavers

14161 search results - page 216 / 2833
» On generalized middle-level problem
Sort
View
HOTSWUP
2009
ACM
15 years 10 months ago
Dynamic Software Updates: The State Mapping Problem
We consider the state mapping problem for dynamic software updates and propose a number of approaches that have the potential of automating the state mapping in practical setting....
Rida A. Bazzi, Kristis Makris, Peyman Nayeri, Jun ...
IWANN
2001
Springer
15 years 9 months ago
Solving NP-Complete Problems With Networks of Evolutionary Processors
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An ...
Juan Castellanos, Carlos Martín-Vide, Victo...
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
15 years 9 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
FLAIRS
2000
15 years 6 months ago
Comparing Performance of Neural Networks Applied to a Simplified Recognition Problem
In this note we present and discuss results of experiments comparing the performance of six neural network architectures (back propagation, recurrent network with dampened feedbac...
Marcin Paprzycki, Rick Niess, Jason Thomas, Lenny ...
ACS
2007
15 years 5 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler