Sciweavers

8699 search results - page 1504 / 1740
» Elements of the Theory of Computation
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
CSCL
2007
114views more  CSCL 2007»
15 years 6 months ago
Community-based learning: The core competency of residential, research-based universities
Traditionally, universities focus primarily on instructionist teaching. Such an understanding has been criticized from theoretical and practical points of view. We believe that so...
Gerhard Fischer, Markus Rohde, Volker Wulf
JNW
2008
167views more  JNW 2008»
15 years 6 months ago
Analyzing the ENRON Communication Network Using Agent-Based Simulation
Agent-based modeling, simulation, and network analysis approaches are one of the emergent techniques among soft computing literature. This paper presents an agent-based model for a...
Shinako Matsuyama, Takao Terano
JCM
2006
112views more  JCM 2006»
15 years 6 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
JCSS
2006
77views more  JCSS 2006»
15 years 6 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
« Prev « First page 1504 / 1740 Last » Next »