Sciweavers

4266 search results - page 289 / 854
» The container loading problem
Sort
View
112
Voted
JSAC
2007
93views more  JSAC 2007»
15 years 4 months ago
Eviction of Misbehaving and Faulty Nodes in Vehicular Networks
— Vehicular Networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor an...
Maxim Raya, Panagiotis Papadimitratos, Imad Aad, D...
121
Voted
TALG
2010
110views more  TALG 2010»
15 years 3 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
FUIN
2010
102views more  FUIN 2010»
15 years 2 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
ADC
2010
Springer
204views Database» more  ADC 2010»
14 years 11 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
JCT
2010
127views more  JCT 2010»
14 years 11 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster