Sciweavers

920 search results - page 47 / 184
» Generating Satisfiable Problem Instances
Sort
View
COR
2010
99views more  COR 2010»
13 years 10 months ago
A new heuristic to solve the one-warehouse N-retailer problem
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin S...
JAIR
2002
182views more  JAIR 2002»
13 years 10 months ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 2 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
TASE
2008
IEEE
13 years 10 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
BMCBI
2006
100views more  BMCBI 2006»
13 years 10 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong