Sciweavers

8190 search results - page 326 / 1638
» From Timed to Hybrid Systems
Sort
View
JMLR
2006
89views more  JMLR 2006»
15 years 6 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
RTSS
1998
IEEE
15 years 11 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson
TPDS
1998
124views more  TPDS 1998»
15 years 6 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
SECON
2008
IEEE
16 years 1 months ago
SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes
—Wireless reprogramming is a key functionality in Wireless Sensor Networks (WSNs). In fact, the requirements for the network may change in time, or new parameters might have to b...
Michele Rossi, Giovanni Zanca, Luca Stabellini, Ri...
WWW
2008
ACM
16 years 7 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng