Sciweavers

2738 search results - page 162 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 10 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
115
Voted
HT
2004
ACM
15 years 10 months ago
Twin media: hypertext structure under pressure
This hypertext reports on issues in hypertext rhetoric and presentation that arise in composing a large argumentative hypertext associated with a book version of the same project....
David Kolb
139
Voted
ASIACRYPT
2004
Springer
15 years 10 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
DAC
2003
ACM
15 years 9 months ago
Symbolic analysis of analog circuits with hard nonlinearity
A new methodology is presented to solve a strongly nonlinear circuit, characterized by Piece-Wise Linear (PWL) functions, symbolically and explicitly in terms of its circuit param...
Alicia Manthe, Zhao Li, C.-J. Richard Shi
134
Voted
SGAI
2009
Springer
15 years 9 months ago
Improving Cooperative PSO using Fuzzy Logic
PSO is a population-based technique for optimization, which simulates the social behavior of the fish schooling or bird flocking. Two significant weaknesses of this method are: fir...
Zahra Afsahi, Mohammad Reza Meybodi