2661 search results - page 311 / 533 » Quantum Complexity Classes |
121
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
125
click to vote
PATAT
1997
Springer
15 years 8 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
166
Voted
INFOCOM
1993
IEEE
15 years 8 months ago
1993
IEEE
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
153
click to vote
VL
1994
IEEE
15 years 8 months ago
1994
IEEE
Employing diagrams in the UI causes problems that don't exist in so called Graphical User Interfaces. We are implementing a tool for generating editors for a certain class of...
162
click to vote
ECML
1993
Springer
15 years 8 months ago
1993
Springer
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...