14386 search results - page 196 / 2878 » The Chinese Generals Problem |
159
click to vote
EJC
2007
15 years 3 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
137
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— Many architectures have been proposed to solve tightly-coupled multirobot tasks (MT) through coalitions of heterogeneous robots. However, several issues remain unaddressed. As ...
151
Voted
SIAMMAX
2010
14 years 10 months ago
2010
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
144
click to vote
JSS
2011
14 years 10 months ago
2011
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
125
click to vote
SIROCCO
2004
15 years 5 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...