Sciweavers

48 search results - page 10 / 10
» On Anytime Coherence-Based Reasoning
Sort
View
AI
2006
Springer
13 years 5 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
IJWIS
2006
91views more  IJWIS 2006»
13 years 5 months ago
Handheld Computing and Programming for Mobile Commerce
: Using Internet-enabled mobile handheld devices to access the World Wide Web is a promising addition to the Web and traditional e-commerce. Mobile handheld devices provide conveni...
Wen-Chen Hu, Jyh-haw Yeh, Lixin Fu, Hung-Jen Yang
SIGMETRICS
2000
ACM
217views Hardware» more  SIGMETRICS 2000»
13 years 5 months ago
Experimenting with an Ad Hoc wireless network on campus: insights and experiences
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
Chai-Keong Toh, Richard Chen, Minar Delwar, Donald...