777 search results - page 148 / 156 » A fast algorithm for the computation of an upper bound on th... |
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
AIPS
2007
13 years 11 months ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
ICDCS
1999
IEEE
14 years 26 days ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...