Sciweavers

1662 search results - page 112 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 11 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
13 years 10 months ago
Multi-objective memetic approach for flexible process sequencing problems
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
Jian-Hong Chen, Jian-Hung Chen
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
14 years 3 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
AAAI
2000
13 years 10 months ago
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
Mathias Broxvall, Peter Jonsson
IJCAI
1989
13 years 10 months ago
Introducing Actions into Qualitative Simulation
Many potential uses of qualitative physics, such as robot planning and intelligent computer-aided engineering, require integrating physics with actions taken by agents. This paper...
Kenneth D. Forbus