Sciweavers

11740 search results - page 195 / 2348
» More Problems in Rewriting
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 8 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ISCA
1993
IEEE
115views Hardware» more  ISCA 1993»
15 years 8 months ago
Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays
Parity encoded redundant disk arrays provide highly reliable, cost effective secondary storage with high performance for read accesses and large write accesses. Their performance ...
Daniel Stodolsky, Garth A. Gibson, Mark Holland
GECCO
2006
Springer
172views Optimization» more  GECCO 2006»
15 years 8 months ago
Multi-objective optimisation of the protein-ligand docking problem in drug discovery
The pharmaceutical industry is facing an ever-increasing demand to discover novel drugs that are more effective and safer than existing ones. The industry faces huge problem in im...
A. Oduguwa, A. Tiwari, S. Fiorentino, R. Roy
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
EPIA
1995
Springer
15 years 8 months ago
The Retrieval Problem in a Concept Language with Number Restrictions
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
Aida Vitória, Margarida Mamede, Luís...