| 1. |
|
|
| 2. |
- Ambrosiani, Björn, et al.
(författare)
-
Symposium on Photointerpretation i Delft
- 1962
-
Ingår i: Fornvännen. - 0015-7813 .- 1404-9430. ; 57, s. 351-353
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
| 3. |
- Arunachalam, Raghu, et al.
(författare)
-
The Supply Chain Management Game for the Trading Agent Competition 2004
- 2004. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This report is the specification for the Trading Agent Competition Supply Chain Management Game - TAC SCM-04, to be held between July 20-22, 2004, in New York in conjunction with AAMAS-04. Based on the experience of the 2003 Trading Agent Competition a few enhancements have been added to the original game: (1)The price function has been modified to better reflect demand; (2) storage costs have been introduced; and (3) customer demand has been segmented into multiple markets.
|
|
| 4. |
|
|
| 5. |
- Collins, John, et al.
(författare)
-
The Supply Chain Management Game for the 2005 Trading Agent Competition
- 2004. - 1
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- The Supply Chain Management Game for the 2005 Trading Agent Competition held during IJCAI 2005, in Edinburgh, Scotland. The supplier model has been substantially revised to overcome the "Day Zero" strategic singularity in TAC SCM 2003 and 2004.
|
|
| 6. |
- Eriksson, Joakim, et al.
(författare)
-
Evolution of a supply chain management game for the trading agent competition
- 2006. - 1
-
Ingår i: AI Communications. ; 19, s. 1-12
-
Tidskriftsartikel (refereegranskat)abstract
- TAC SCM is a supply chain management game for the Trading Agent Competition (TAC). The purpose of TAC is to spur high quality research into realistic trading agent problems. We discuss TAC and TAC SCM: game and competition design, scientific impact, and lessons learnt.
|
|
| 7. |
- Eriksson, Joakim, et al.
(författare)
-
SICS MarketSpace: an agent-based market infrastructure
- 1998. - 1
-
Konferensbidrag (refereegranskat)abstract
- We present a simple and uniform communication framework for an agent-based market infrastructure, the goal of which is to enable automation of markets with self-interested participants distributed over the Internet.
|
|
| 8. |
- Eriksson, Joakim, et al.
(författare)
-
The trading agent competition: TAC 2002
- 2002. - 1
-
Ingår i: ERCIM News. - 0926-4981 .- 1564-0094. ; :51
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- The finals of the third annual Trading Agent Competition were held on 28 July 2002, co-located with AAA1-02 in Edmonton, Canada. The actual games took place on the Internet, with the game and auction servers running at SICS in Kista, Sweden. The agents resided at the home locations of the participating research groups.
|
|
| 9. |
|
|
| 10. |
- Eriksson, Joakim, et al.
(författare)
-
Towards self-managing systems
- 2004. - 1
-
Ingår i: ERCIM News. - 0926-4981 .- 1564-0094. ; :58
-
Tidskriftsartikel (populärvet., debatt m.m.)
|
|
| 11. |
- Faxén, Karl-Filip, et al.
(författare)
-
Embla - Data Dependence Profiling for Parallel Programming
- 2008. - 10
-
Ingår i: Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems. ; , s. 780-785
-
Konferensbidrag (refereegranskat)abstract
- With the proliferation of multicore processors, there is an urgent need for tools and methodologies supporting parallelization of existing applications. In this paper, we present a novel tool for aiding programmers in parallelizing programs. The tool, Embla, is based on the Valgrind framework, and allows the user to discover the data dependences in a sequential program, thereby exposing opportunities for parallelization. Embla performs an off-line dynamic analysis, and records dependences as they arise during program execution. It reports an optimistic view of parallelizable sequences, and ignores dependences that do not arise during execution. Moreover, since the tool instruments the machine code of the program, it is largely language independent. Since Embla finds the dependencies that occur for particular executions, the confidence one would assign to its results depend on whether different executions yield different (bad) or largely the same (good) dependencies. We present a preliminary investigation into this issue using 84 different inputs to the SPEC CPU 2006 benchmark 403.gcc. The results indicate that there is a strong correlation between coverage and finding dependencies; executing the entire program is likely to reveal all dependencies.
|
|
| 12. |
- Galaz, Victor, et al.
(författare)
-
AI i klimatets tjänst : en kartläggning av svensk kompetens i ett internationellt perspektiv
- 2021
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Klimatutmaningen ställer mycket stora krav på samhället. I takt med att klimatförändringarnas effekter blir allt tydligare genom bland annat omfattande skogsbränder, smältande havsisar, och extremoväder, så får klimatfrågan också allt större uppmärksamhet i det offentliga samtalet, hos beslutsfattare, och inom näringsliv och civilsamhälle. Teknikutvecklingen har alltid varit viktig i diskussionen om klimatfrågans orsaker och lösningar, liksom för forskning om hållbar utveckling i stort. I takt med att artificiell intelligens (AI) sett en språngvis utveckling och dess tillämpningar tycks öka på flera samhällsområden, så ökar också intresset för hur AI kan bidra till att tackla klimatutmaningen i alla dess dimensioner - från grundläggande klimatforskning, till klimatanpassning och klimatinnovation. Följande rapport, AI i klimatets tjänst, ger en överblick av potentialen hos AI för klimatutmaningen. Rapporten presenterar också en kartläggning av potentialen för Sverige att bli internationellt ledande inom detta område. Analysen bygger på en litteraturöversikt, intervjuer, en enkätundersökning och en systematisk genomgång av klimatrelaterad AI-forskning i Sverige och utomlands. Resultaten är på intet sätt slutgiltiga, utan ger en överblicksbild av ett snabbt växande område. Vi hoppas att rapporten ska kunna fungera som ett första diskussionsunderlag för de myndigheter, företag, forskare och andra som är intresserade av att vidareutveckla potentialen hos AI-tekniker och deras användning för klimatutmaningen.
|
|
| 13. |
- Haridi, Seif, et al.
(författare)
-
Kernel Andorra Prolog and its computation model
- 1990. - 12
-
Ingår i: Logic Programming: Proceedings of the Seventh International Conference. - : MIT Press. - 0262730901
-
Bokkapitel (refereegranskat)abstract
- The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints.
|
|
| 14. |
- Haridi, Seif, et al.
(författare)
-
Kernel Andorra Prolog and its Computational Model
- 1990. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable.
|
|
| 15. |
- Holmgren, Fredrik, et al.
(författare)
-
Interactive Visual Analysis of Networked Systems: Workflows for Two Industrial Domains
- 2008. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- We report on a first study of interactive visual analysis of networked systems. Working with ABB Corporate Research and Ericsson Research, we have created workflows which demonstrate the potential of visualization in the domains of industrial automation and telecommunications. By a workflow in this context, we mean a sequence of visualizations and the actions for generating them. Visualizations can be any images that represent properties of the data sets analyzed, and actions typically either change the selection of data visualized or change the visualization by choice of technique or change of parameters.
|
|
| 16. |
|
|
| 17. |
|
|
| 18. |
- Janson, Sverker, et al.
(författare)
-
Finding out = Achieving Decidability
- 1989. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- We present a framework for reasoning about the concepts of "knowing what" and "finding out", in which the key concept is to identify "finding out the answer to question Q" with "achieving a situation in which Q is decidable" . We give examples of how the framework can be used to formulate non-trivial problems involving the construction of plans to acquire and use information, and go on to demonstrate that these problems can often be solved by systematic application of a small set of goal-directed backward-chaining rules. In conclusion, it is suggested that systems of this kind are potentially implementable in l-Prolog, a logic programming language based on higher-order logic.
|
|
| 19. |
|
|
| 20. |
- Janson, Sverker, et al.
(författare)
-
Programming paradigms of the Andorra Kernel Language
- 1991. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The Andorra Kernel Language (AKL) is introduced. It is shown how AKL provides the programming paradigms of both Prolog and GHC. This is the original goal of the design. However, it has also been possible to provide capabilities beyond that of Prolog and GHC. There are means to structure search, more powerful than plain backtracking. It is possible to encapsulate search in concurrent reactiveprocesses. It is also possible to write a multi-way merger with constant delay.In these respects AKL is quite original. Although AKL is an instance of our previously introduced Kernel Andorra Prolog framework, this exposition contains important extensions, and a considerable amount of unnecessary formal overhead has been stripped away.
|
|
| 21. |
- Janson, Sverker, et al.
(författare)
-
PROMPT LEARNINGS
- 2021
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The PROMPT project has resulted in a great number of second cycle courses for professionals in software engineering and development. It has also led to an accumulation of learning experiences regarding the offering of such courses online. This report summarizes the learnings that project partner RISE has made and its contributions towards the common project goal of establishing a catalog of continuous-education courses for Swedish software industry. We report on how courses should be designed and conducted. The experience is that a clear structure and set of goals is needed, with teaching that activates the participants and supports retention. Professional training may require different formats for given contents to suit both part-time students as well as those who quickly want to learn full-time. Online education requires good system support and we summarize the experiences from Scalable Learning, a tool provided by RISE, which can inform other system providers of useful functionality. We end with a look at design exercises for the future of technical universities.
|
|
| 22. |
- Janson, Sverker
(författare)
-
Riksantikvarieämbetet och dess ombud
- 1950
-
Ingår i: Fornvännen. - 0015-7813 .- 1404-9430. ; 45, s. 181-182
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
| 23. |
|
|
| 24. |
|
|
| 25. |
|
|
| 26. |
- Karlsson, Gunnar, et al.
(författare)
-
Universiteten som försvann
- 2013
-
Ingår i: Svenska Dagbladet. - Stockholm : Svenska Dagbladet AB & Co.. - 1101-2412. ; :19 maj
-
Tidskriftsartikel (populärvet., debatt m.m.)
|
|
| 27. |
-
KTH Utbildningar 2027/2028
- 2017
-
Konstnärligt arbeteabstract
- I projektet Framtidens KTH-utbildningar har vi tagit fram förslag på hur vår verksamhet skulle kunna se ut för studenter, lärare, alumner och arbetsgivare – eller vad de kommer att vara. Visioner blir ofta luddiga så vi har istället skapat konkreta bilder som vi hoppas öppnar för samtal och ett vidare arbete med utbildningar för läsåret 2027/2028 då KTH firar tvåhundraårsjubileum.Denna katalog är endast till för idévärlden och innebär inget åtagande för KTH att erbjuda de utbildningar eller koncept som beskrivs. Men det är tillåtet att önska sig dem.
|
|
| 28. |
- Olsson, Tomas, et al.
(författare)
-
Personalized Decentralized Communication
- 2000. - 1
-
Konferensbidrag (refereegranskat)abstract
- Search engines, portals and topic-centered web sites are all attempts to create more or less personalized web-services. However, no single service can in general fulfill all needs of a particular user, so users have to search and maintain personal profiles at several locations. We propose an architecture where each person has his own information management environment where all personalization is made locally. Information is exchanged with other’s if it’s of mutual interest that the information is published or received. We assume that users are self-interested, but that there is some overlap in their interests. Our recent work has focused on decentralized dissemination of information, specifically what we call decentralized recommender systems. We are investigating the behavior of such systems and have also done some preliminary work on the users’ information environment.
|
|
| 29. |
|
|
| 30. |
- Rasmusson, Lars, et al.
(författare)
-
Libra, a Multi-hop Radio Network Bandwidth Market
- 2007. - 1
-
Konferensbidrag (refereegranskat)abstract
- Libra is a two-level market which assigns fractional shares of time to the transmitting nodes in local regions of a multi-hop network. In Libra, users are assigned budgets by management and users assign funding to services within their budget limits. The purpose is to prioritize users and also optimize network utilization by preventing source nodes from injecting too much traffic into the network and thereby causing downstream packet loss. All transmitting nodes sell capacity in the region surrounding them, and buy capacity from their neighbors in order to be able to transmit. Streams buy capacity from each of the nodes on their paths, thus streams that cross the same region compete directly for the bandwidth in that region. Prices are adjusted incrementally on both levels.
|
|
| 31. |
- Rayner, Manny, et al.
(författare)
-
Epistemic reasoning, logic programming, and the interpretation of questions
- 1987. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Reasons are given to support the claim that strong connections exist between linguistic theories on question semantics and work within AI and logic programming. Various ways of assigning denotations to questions are compared, and it is argued that the earlier, "naive" version is to be preferred to more recent developments. It is shown that it is possible to use the chosen denotation to give a model-theoretic semantics for the concept of "knowing what", from which a relationship between "knowing what" and "knowing" can provably be derived. An application to logic programming is described, which allows formal reasoning about what a logic database "knows", this being in a sense a generalization of the Closed World Assumption. Finally, a "knows-what" meta-interpreter in Prolog is demonstrated, and proved to be sound and complete for a certain class of database programs.
|
|
| 32. |
- Sadeh, Norman M., et al.
(författare)
-
TAC-03: a supply-chain trading competition
- 2003. - 2
-
Ingår i: The AI Magazine. - 0738-4602. ; 24:1, s. 92-94
-
Tidskriftsartikel (refereegranskat)abstract
- The Trading Agent Competition (TAC) has now become an annual fixture since its inception in 2000. The competition was conceived with the objective of studying automated trading strategies by focusing the research community on the development of competing solutions to a common trading scenario. The success of past TAC events has motivated broadening the scope of the competition beyond the context of the travel agent scenario used thus far. For the fourth edition of this competition, TAC-03, to be held in August 2003, the authors have created a novel supply-chain trading game with the aim of investigating automated agents in the context of dynamic supply-chain management.
|
|
