100 search results - page 3 / 20 » Combination of Lower Bounds in Exact BDD Minimization |
DIALM
2005
ACM
14 years 21 days ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
ISTCS
1997
Springer
14 years 2 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
COR
2008
13 years 10 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
APVIS
2008
14 years 6 days ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
ICRA
2008
IEEE
14 years 5 months ago
2008
IEEE
— This paper relates 5 observability indexes for robot calibration to the “alphabet optimalities” from the experimental design literature. These 5 observability indexes are s...