Sciweavers

5331 search results - page 736 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
15 years 12 months ago
Commitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 11 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
KES
2000
Springer
15 years 10 months ago
Knowledge based genetic algorithm for dynamic route selection
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
Hitoshi Kanoh, Tomohiro Nakamura
CP
2008
Springer
15 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
169
Voted
WISES
2008
15 years 8 months ago
Fusion of heterogeneous sensors data
A configuration with heterogeneous sensors using different measurement approaches most likely overcome the problem of correlated measurement errors as they occur when employing a ...
Wilfried Elmenreich, Robert Leidenfrost