13376 search results - page 64 / 2676 » Problem Solving with |
128
click to vote
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
108
click to vote
PATAT
2004
Springer
15 years 6 months ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
147
click to vote
COR
2008
15 years 9 days ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
130
Voted
PKC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
105
click to vote
ESA
2006
Springer
15 years 4 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...