Sciweavers

66 search results - page 5 / 14
» Computing All Integer Solutions of a General Elliptic Equati...
Sort
View
DAC
2003
ACM
15 years 10 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
ICCV
2005
IEEE
15 years 3 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
ICALP
2007
Springer
15 years 3 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel
TEC
2002
117views more  TEC 2002»
14 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
COR
2006
113views more  COR 2006»
14 years 9 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang