Sciweavers

664 search results - page 66 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
VLDB
1990
ACM
89views Database» more  VLDB 1990»
15 years 1 months ago
Database Updates through Abduction
: The problem of view updatesin deductive databasesis studiedby casting this in anaturally associatedabductive framework.It is shownthat this abductiveapproachdeals successfully, i...
Antonis C. Kakas, Paolo Mancarella
DGCI
2009
Springer
15 years 1 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...
77
Voted
FMCAD
2008
Springer
14 years 11 months ago
Optimal Constraint-Preserving Netlist Simplification
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
Jason Baumgartner, Hari Mony, Adnan Aziz
ICGA
1993
140views Optimization» more  ICGA 1993»
14 years 11 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
14 years 10 months ago
On stability of second-order quasi-polynomials with a single delay
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are lim...
Efim Malakhovski, Leonid Mirkin