Sciweavers

1487 search results - page 118 / 298
» The Computational Complexity of Link Building
Sort
View
ICC
2007
IEEE
15 years 10 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
CSFW
2006
IEEE
15 years 10 months ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers
WONS
2005
IEEE
15 years 10 months ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...
SEMWEB
2004
Springer
15 years 9 months ago
Working with Multiple Ontologies on the Semantic Web
The standardization of the second generation Web Ontology Language, OWL, leaves a crucial issue for Web-based ontologies unsatisfactorily resolved: how to represent and reason with...
Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 9 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak