Sciweavers

3528 search results - page 120 / 706
» A New Approach to Planning in Networks
Sort
View
ESWA
2007
100views more  ESWA 2007»
14 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
ICDAR
2007
IEEE
15 years 4 months ago
A Bayesian Network Approach to Mode Detection for Interactive Maps
This paper describes a mode detection system for online pen input that employs a Bayesian network to combine classification results and context information. Previous monolithic c...
Don Willems, Louis Vuurpijl
NORDSEC
2009
Springer
15 years 4 months ago
A Parallelism-Based Approach to Network Anonymization
Considering topologies of anonymous networks we used to organizing anonymous communications into hard to trace paths, composed of several middleman nodes, towards hiding communicat...
Igor Margasinski
ECTEL
2007
Springer
15 years 4 months ago
CAMEL: Taking the Technology Enhanced Learning Journey without Reinventing the Wheel
Projects involving technology are notoriously dogged with difficulties and a number of lessons can be learned. Rather than detail examples from particular TEL projects, the author ...
Gill Ferrell
AIPS
2008
15 years 9 days ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein