Sciweavers

1197 search results - page 115 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICTAI
2010
IEEE
13 years 6 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
IJCAI
2001
13 years 9 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
CONSTRAINTS
2008
109views more  CONSTRAINTS 2008»
13 years 8 months ago
The Design of the Zinc Modelling Language
Zinc is a new modelling language developed as part of the G12 project. It has four important characteristics. First, Zinc allows speci cation of models using a natural mathematical...
Kim Marriott, Nicholas Nethercote, Reza Rafeh, Pet...
CG
2011
Springer
12 years 12 months ago
A projected back-tracking line-search for constrained interactive inverse kinematics
Inverse kinematics is the problem of manipulating the pose of an articulated figure in order to achieve a desired goal disregarding inertia and forces. One can approach the probl...
Morten Engell-Nørregård, Kenny Erlebe...
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 10 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu