Sciweavers

16504 search results - page 278 / 3301
» New Problems, New Solutions
Sort
View
PRICAI
1998
Springer
15 years 11 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
EUROCRYPT
2006
Springer
15 years 10 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
MIC
2003
116views Control Systems» more  MIC 2003»
15 years 8 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
CHI
2006
ACM
16 years 7 months ago
The project fragmentation problem in personal information management
The project fragmentation problem in personal information management occurs when someone who is working on a single project stores and retrieves information items relating to that...
Ofer Bergman, Ruth Beyth-Marom, Rafi Nachmias
CEC
2008
IEEE
16 years 1 months ago
A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
Bernabé Dorronsoro, Enrique Alba, Gabriel L...