4218 search results - page 379 / 844 » Complete sets of cooperations |
191
Voted
TCS
2008
15 years 7 months ago
2008
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...
242
click to vote
IACR
2011
14 years 7 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
180
Voted
ESWS
2009
Springer
16 years 2 months ago
2009
Springer
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
189
click to vote
ESOP
2001
Springer
16 years 2 days ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
219
Voted
CP
2000
Springer
15 years 12 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...