2128 search results - page 121 / 426 » A general characterization of indulgence |
145
click to vote
ICCBR
2010
Springer
15 years 2 months ago
2010
Springer
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
138
click to vote
QEST
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In this paper we study a broad class of semiMarkovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue an...
128
click to vote
JSYML
2010
14 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
164
click to vote
TON
2010
14 years 11 months ago
2010
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
137
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...