636 search results - page 83 / 128 » Smart Objects for Intelligent Applications - ADK |
149
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
147
click to vote
ICTAI
1993
IEEE
15 years 10 months ago
1993
IEEE
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
179
click to vote
AMAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
173
click to vote
ICIA
2007
15 years 8 months ago
2007
There is a growing interest in intelligent assistants for a variety of applications from organizing tasks for knowledge workers to helping people with dementia. In our earlier wor...
169
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study through simulation the performance of two MANET routing algorithms in a realistic urban environment. The two algorithms, AODV and AntHocNet, are representative o...