3433 search results - page 482 / 687 » Heuristics for a bidding problem |
202
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
190
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
180
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
172
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper considers the problem of dedicated path-protection in a wavelength-division multiplexing (WDM) mesh network with waveband switching (WBS) functionality under shared ...
195
click to vote
MOBIQUITOUS
2007
IEEE
16 years 28 days ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...