Sciweavers

1034 search results - page 97 / 207
» Wide Classes
Sort
View
CN
2006
99views more  CN 2006»
13 years 8 months ago
P2P reputation management: Probabilistic estimation vs. social networks
Managing trust is a key issue for a wide acceptance of P2P computing, particularly in critical areas such as e-commerce. Reputation-based trust management has been identified in t...
Zoran Despotovic, Karl Aberer
JGAA
2006
127views more  JGAA 2006»
13 years 8 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
URBAN
2008
86views more  URBAN 2008»
13 years 8 months ago
Social area analysis, data mining, and GIS
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
Seth E. Spielman, Jean-Claude Thill
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 8 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 8 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski