Sciweavers

5889 search results - page 823 / 1178
» Graph Layout Problems
Sort
View
EOR
2006
82views more  EOR 2006»
15 years 6 months ago
Flowshop scheduling research after five decades
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
Jatinder N. D. Gupta, Edward F. Stafford
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
IGPL
2007
45views more  IGPL 2007»
15 years 6 months ago
On Positive Relational Calculi
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...
AMAI
2005
Springer
15 years 6 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder
APPML
2002
58views more  APPML 2002»
15 years 6 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik