Sciweavers

8298 search results - page 1369 / 1660
» On the Complexity of Numerical Analysis
Sort
View
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ITS
2010
Springer
148views Multimedia» more  ITS 2010»
15 years 11 months ago
Developing Empirically Based Student Personality Profiles for Affective Feedback Models
The impact of affect on learning has been the subject of increasing attention. Because of the differential effects of students’ affective states on learning outcomes, there is a ...
Jennifer L. Robison, Scott W. McQuiggan, James C. ...
KESAMSTA
2010
Springer
15 years 11 months ago
Symmetry Approach to Evacuation Scenarios
The first trial of using the symmetry analysis method in modeling of behavior of complex social system is presented in this work. The evacuation of large building scenarios are d...
Wieslawa Sikora, Janusz Malinowski
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 11 months ago
Robust stability of multi-hop control networks
Abstract— We propose formal models for analyzing robustness of multi-hop control networks, where data from sensors to controllers and from controllers to actuators is sent throug...
Gera Weiss, Alessandro D'Innocenzo, Rajeev Alur, K...
« Prev « First page 1369 / 1660 Last » Next »