Sciweavers

926 search results - page 3 / 186
» Algorithms on Ideal over Complex Multiplication order
Sort
View
HYBRID
2010
Springer
14 years 18 days ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
FASE
2010
Springer
14 years 18 days ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
TWC
2008
120views more  TWC 2008»
13 years 5 months ago
Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and...
Anders Gjendemsjø, David Gesbert, Geir E. &...
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
14 years 2 days ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 5 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...