Sciweavers

314 search results - page 39 / 63
» On Tools for Analysis of Collaborative Problem Solving
Sort
View
MP
2006
123views more  MP 2006»
13 years 8 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
JMLR
2012
11 years 11 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
CP
2003
Springer
14 years 1 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 11 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
JOT
2008
122views more  JOT 2008»
13 years 8 months ago
UML and Object Oriented Drama
Readers of this article have probably seen, at least once, diagrams produced using the UML (Unified Modeling Language). Some of you have perhaps used UML for your own work and kno...
Luca Vetti Tagliati, Carlo Caloro