Sciweavers

868 search results - page 35 / 174
» Finding Most Likely Solutions
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
CSI
2006
136views more  CSI 2006»
13 years 7 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
WLP
2004
Springer
14 years 1 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták
CBMS
2002
IEEE
14 years 20 days ago
A Framework for Radiological Assistant Systems
The market for health care systems supporting physicians and improving their daily routine is dynamically growing. The development of these systems makes great demands on the hand...
Dirk Krechel, Ralph Bergmann, Kerstin Maximini, Al...
DIS
2010
Springer
13 years 5 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...