Sciweavers

636 search results - page 83 / 128
» Smart Objects for Intelligent Applications - ADK
Sort
View
ECAI
2000
Springer
15 years 4 months ago
Search Pruning Conditions for Boolean Optimization
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...
Vasco M. Manquinho, João P. Marques Silva
ICTAI
1993
IEEE
15 years 4 months ago
Short Term Unit-Commitment Using Genetic Algorithms
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...
Dipankar Dasgupta, Douglas R. McGregor
AMAI
2000
Springer
15 years 3 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
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...
Vasco M. Manquinho, João P. Marques Silva
ICIA
2007
15 years 2 months ago
A Decision-Theoretic Model of Assistance - Evaluation, Extensions and Open Problems
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...
Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli...
ANTSW
2008
Springer
15 years 1 months ago
A Simulation Study of Routing Performance in Realistic Urban Scenarios for MANETs
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...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...