Sciweavers

1857 search results - page 245 / 372
» Minimum Degree Orderings
Sort
View
AIPS
2004
15 years 7 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
MIC
2003
116views Control Systems» more  MIC 2003»
15 years 7 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
AAAI
1998
15 years 7 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
ACL
1998
15 years 7 months ago
Neural Network Recognition of Spelling Errors
One area in which artificial neural networks (ANNs) may strengthen NLP systems is in the identification of words under noisy conditions. In order to achieve this benefit when spel...
Mark Lewellen