Sciweavers

3663 search results - page 146 / 733
» Problems in the ontology of computer programs
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 3 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
SARA
2009
Springer
15 years 4 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
APPT
2005
Springer
15 years 3 months ago
Autonomous-Centered Problem Allocation Oriented to Cooperation
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
Xiping Liu, Wan-Chun Dou, Guihai Chen, Shijie Cai,...
COMPULOG
1999
Springer
15 years 2 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
14 years 11 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs