1943 search results - page 331 / 389 » Ordering Default Theories |
166
click to vote
JACM
2000
15 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
154
click to vote
ACTAC
1998
15 years 5 months ago
1998
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
154
click to vote
COMCOM
1998
15 years 5 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
171
click to vote
NAR
2002
15 years 5 months ago
2002
The SCOP (Structural Classification of Proteins) database is a comprehensive ordering of all proteins of known structure, according to their evolutionary and structural relationsh...
170
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...