Sciweavers

1274 search results - page 152 / 255
» N-fold integer programming
Sort
View
TRIER
2002
13 years 9 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
COR
2008
110views more  COR 2008»
13 years 9 months ago
Modeling health care facility location for moving population groups
Locating public services for nomadic population groups is a difficult challenge as the locations of the targeted populations seasonally change. In this paper, the population group...
Malick Ndiaye, Hesham K. Alfares
IEEECIT
2010
IEEE
13 years 8 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
MEDBIOMETRICS
2010
13 years 8 months ago
A DIAMOND Method for Classifying Biological Data
This study proposes an effective method called DIAMOND to classify biological and medical data. Given a set of objects with some classes, DIAMOND separates the objects into differe...
Han-Lin Li, Yao-Huei Huang, Ming-Hsien Chen
MFCS
2010
Springer
13 years 8 months ago
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
Kenya Ueno