Sciweavers

4865 search results - page 674 / 973
» The Complexity of Graph Connectivity
Sort
View
ICCAD
2003
IEEE
114views Hardware» more  ICCAD 2003»
16 years 1 months ago
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
Peter G. Sassone, Sung Kyu Lim
APSCC
2009
IEEE
15 years 12 months ago
Security meta-services orchestration architecture
SOA have been deployed as a mean to offer a better flexibility, to increase efficiency through reuse of services and also to improve interoperability by providing new opportunit...
Aymen Baouab, Olivier Perrin, Nicolas Biri, Claude...
121
Voted
GLOBECOM
2009
IEEE
15 years 11 months ago
A Fresh Look at Multicanonical Monte Carlo from a Telecom Perspective
—The Multicanonical Monte Carlo (MMC) technique is a new form of adaptive importance sampling (IS). Thanks to its blind adaptation algorithm, it does not require an in-depth syst...
Alberto Bononi, Leslie A. Rusch, Amirhossein Ghazi...
ICDAR
2009
IEEE
15 years 11 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
WMCSA
2009
IEEE
15 years 11 months ago
Context-aware composition
Context–Aware Composition is a technique to overcome the complexity of wireless discovery, device selection, and establishing connections to other computers in an environment wh...
Kent Lyons, Roy Want, David Munday, Jiasheng He, S...