4218 search results - page 456 / 844 » Complete sets of cooperations |
192
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
226
click to vote
DATE
2005
IEEE
2005
IEEE
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
15 years 9 months ago
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
182
click to vote
DAWAK
2008
Springer
15 years 9 months ago
2008
Springer
In order to be able to evaluate beforehand the impact of a strategical or tactical move, decision makers need reliable previsional systems. What-if analysis satisfies this need by ...
202
click to vote
DEXA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The content of most Web pages is dynamically derived from an underlying relational database. Thus, the success of the Semantic Web hinges on enabling access to relational...
230
click to vote
FASE
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...