352 search results - page 6 / 71 » Problem section |
WG
2005
Springer
15 years 5 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
101
click to vote
HIPC
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
WCRE
1995
IEEE
15 years 3 months ago
1995
IEEE
One of the factors that can make a program di cult to understand is that code responsible for accomplishing more than one purpose may be woven together in a single section. We cal...
JOTA
2011
14 years 2 months ago
2011
In this paper, we first obtain an existence theorem of the solutions for a variational relation problem. An existence theorem for a variational inclusion problem, a KKM theorem wi...
101
click to vote
COLT
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...