| 1. |
- LeBlanc, K., et al.
(författare)
-
Team Chaos 2004
- 2004
-
Konferensbidrag (refereegranskat)
|
|
| 2. |
- LeBlanc, K., et al.
(författare)
-
Team Sweden 2003
- 2003
-
Konferensbidrag (refereegranskat)
|
|
| 3. |
- Abghari, Shahrooz, et al.
(författare)
-
Higher order mining for monitoring district heating substations
- 2019
-
Ingår i: Proceedings - 2019 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2019. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781728144931 ; , s. 382-391
-
Konferensbidrag (refereegranskat)abstract
- We propose a higher order mining (HOM) approach for modelling, monitoring and analyzing district heating (DH) substations' operational behaviour and performance. HOM is concerned with mining over patterns rather than primary or raw data. The proposed approach uses a combination of different data analysis techniques such as sequential pattern mining, clustering analysis, consensus clustering and minimum spanning tree (MST). Initially, a substation's operational behaviour is modeled by extracting weekly patterns and performing clustering analysis. The substation's performance is monitored by assessing its modeled behaviour for every two consecutive weeks. In case some significant difference is observed, further analysis is performed by integrating the built models into a consensus clustering and applying an MST for identifying deviating behaviours. The results of the study show that our method is robust for detecting deviating and sub-optimal behaviours of DH substations. In addition, the proposed method can facilitate domain experts in the interpretation and understanding of the substations' behaviour and performance by providing different data analysis and visualization techniques.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Butt, Rehman, et al.
(författare)
-
Where do we go now? Anytime algorithms for path planning
- 2009
-
Konferensbidrag (refereegranskat)abstract
- Commercial computer games has become one of the largest industries in the area of entertainment. Real Time Strategy (Rts) based games is one of the most important among different types of computer games and is also considered to be a good research platform within Artificial Intelligence (Ai). There exists a number of algorithms that can deal with the Ai related problems of this domain, e.g. the ones of getting as cheap or fast as possible from one point to another (i.e. path planning). However most of the algorithms used in academia are better suited for problems that do not need to be solved within tight time frames. Anytime algorithms (Aa) are algorithms that can be stopped at any point in time and yet come up with a preliminary solution. We believe that by making algorithms anytime, we can optimize their behaviors to better suit the Rts domain. This study will introduce a tool for evaluating path planning algorithms and compare the performances of A*, Recursive Best First Search (Rbfs), Potential Fields (Pf) and their anytime versions for the path planning problem.
|
|
| 7. |
|
|
| 8. |
- Carlsson, Bengt, et al.
(författare)
-
Generous and greedy strategies
- 1999
-
Ingår i: Complexity International. - 1320-0682. ; 6
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce generous, even-matched, and greedy strategies ÊÊas concepts for analyzing games. A two person prisoner's dilemma Êgame is described by the four outcomes (C,D), (C,C), (D,C), and (D,D). In a generous strategy the proportion of (C,D) is larger than that of (D,C), i.e. the probability of facing a defecting agent is larger than the probability of defecting. An even-matched strategy has the (C,D) proportion approximately equal to that of (D,C). A greedy strategy is an inverted generous strategy. The basis of the partition is that it is a zero-sum game given that the sum of the proportions of strategies (C,D) must equal that of (D,C). In a population simulation, we compare the prisoner's dilemma (PD) game with the chicken game Ê(CG), given complete as well as partial knowledge of the rules for moves in the other strategies. In a traffic intersection example, we expected a co-operating generous strategy to be successful when the cost for collision was high in addition to the presence of uncertainty. The simulation indeed showed that a generous strategy was successful in the CG part, in which agents faced uncertainty about the outcome. If the resulting zero-sum game is changed from a PD game to a CG, or if the noise level is increased, it will favor generous strategies rather than an even-matched or greedy strategies.
|
|
| 9. |
- Carlsson, Bengt, et al.
(författare)
-
Security Aspects on Inter-Organizational Cooperation Using Wrapper Agents
- 2005
-
Konferensbidrag (refereegranskat)abstract
- The significance of electronic information exchange in interorganizational cooperation is well-known. We will here focus on the particular requirements of SMEs. We describe a general “wrapper agent” solution based on open source freeware that makes it possible (in principle) for any business system to exchange information with any other business system. It has been successfully applied in a pilot study involving two companies in a transport chain using different business systems. We also suggest further improvements by addressing security and privacy issues as well as an extended, possibly dynamic, set of involved companies and higher levels of cooperation.
|
|
| 10. |
- Carlsson, Bengt, et al.
(författare)
-
Security aspects on inter-organizational cooperation using wrapper agents
- 2009
-
Konferensbidrag (refereegranskat)abstract
- The significance of electronic information exchange in inter-organizational cooperation is well-known. We will here focus on the particular requirements of SMEs. We describe a general wrapper agent solution based on open source freeware that makes it possible (in principle) for any business system to exchange information with any other business system. It has been successfully applied in a pilot study involving two companies in a transport chain using different business systems. We also suggest further improvements by addressing security issues as well as an extended, possibly dynamic, set of involved companies and higher levels of cooperation.
|
|
