7123 search results - page 183 / 1425 » The Ordered Set of Rough Sets |
189
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
158
click to vote
TCOM
2008
15 years 6 months ago
2008
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
156
click to vote
JSYML
2010
15 years 1 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...
279
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
178
click to vote
IJCAI
2007
15 years 8 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...