Sciweavers

405 search results - page 41 / 81
» AI planning: solutions for real world problems
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
AIPS
2003
13 years 9 months ago
Symmetry Reduction for SAT Representations of Transition Systems
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
Jussi Rintanen
INFOCOM
2009
IEEE
14 years 2 months ago
Wi-Sh: A Simple, Robust Credit Based Wi-Fi Community Network
— Wireless community networks, where users share wireless bandwidth is attracting tremendous interest from academia and industry. Companies such as FON have been successful in at...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Ahlem Ben Hassine, Tu Bao Ho
ASPDAC
2006
ACM
134views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Constraint driven I/O planning and placement for chip-package co-design
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
Jinjun Xiong, Yiu-Chung Wong, Egino Sarto, Lei He