Sciweavers

1702 search results - page 32 / 341
» Doomed program points
Sort
View
IPCO
2007
109views Optimization» more  IPCO 2007»
15 years 4 months ago
Inequalities from Two Rows of a Simplex Tableau
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
Kent Andersen, Quentin Louveaux, Robert Weismantel...
116
Voted
CP
2005
Springer
15 years 8 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
118
Voted
IJNSEC
2006
94views more  IJNSEC 2006»
15 years 2 months ago
A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
Sangook Moon
101
Voted
AOSD
2006
ACM
15 years 8 months ago
Expressing different conceptual models of join point selections in aspect-oriented design
When specifying pointcuts, i.e. join point selections, in AspectOriented Software Development, developers have in different situations different conceptual models in mind. Aspect-...
Dominik Stein, Stefan Hanenberg, Rainer Unland
IPPS
1998
IEEE
15 years 6 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun