1480 search results - page 139 / 296 » Ants can solve constraint satisfaction problems |
176
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
183
click to vote
PRDC
2007
IEEE
16 years 23 days ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
184
click to vote
PPDP
1999
Springer
15 years 10 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
181
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
143
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...