2398 search results - page 436 / 480 » Constraint Programming and Graph Algorithms |
TELETRAFFIC
2007
Springer
15 years 5 months ago
2007
Springer
Multi-service mesh networks allow existence of guaranteed delay Quality-of-Service (QoS) traffic streams such as Voice over IP and best effort QoS traffic streams such as file tr...
MICAI
2005
Springer
15 years 4 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
121
click to vote
FSTTCS
2003
Springer
15 years 4 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
95
Voted
SIGMOD
1998
ACM
15 years 3 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
122
click to vote
MICRO
1997
IEEE
15 years 3 months ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...