Change search
Refine search result
1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Arunachalam, Raghu
    et al.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Sadeh, Norman M.
    The Supply Chain Management Game for the Trading Agent Competition 20042004Report (Other academic)
    Abstract [en]

    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.

  • 2. Carlson, Björn
    et al.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The implementation of AKL(FD)1995Conference paper (Refereed)
  • 3. Collins, John
    et al.
    Arunachalam, Raghu
    Sadeh, Norman M.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The Supply Chain Management Game for the 2005 Trading Agent Competition2004Other (Other academic)
    Abstract [en]

    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.

  • 4.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Evolution of a supply chain management game for the trading agent competition2006In: AI Communications, Vol. 19, p. 1-12Article in journal (Refereed)
    Abstract [en]

    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.

  • 5.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    SICS MarketSpace: an agent-based market infrastructure1998Conference paper (Refereed)
    Abstract [en]

    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.

  • 6.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    To each and everyone an agent: augmenting web-based commerce with agents1998Conference paper (Refereed)
  • 7.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Towards self-managing systems2004In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 58Article in journal (Other (popular science, discussion, etc.))
  • 8.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The trading agent competition: TAC 20022002In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 51Article in journal (Other (popular science, discussion, etc.))
    Abstract [en]

    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.
    Faxén, Karl-Filip
    et al.
    RISE, Swedish ICT, SICS.
    Popov, Konstantin
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Albertsson, Lars
    RISE, Swedish ICT, SICS.
    Embla - Data Dependence Profiling for Parallel Programming2008In: Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems, 2008, 10, p. 780-785Conference paper (Refereed)
    Abstract [en]

    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.

  • 10.
    Haridi, Seif
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Kernel Andorra Prolog and its computation model1990In: Logic Programming: Proceedings of the Seventh International Conference, MIT Press , 1990, 12Chapter in book (Refereed)
    Abstract [en]

    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.

  • 11.
    Haridi, Seif
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Kernel Andorra Prolog and its Computational Model1990Report (Other academic)
    Abstract [en]

    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.

  • 12.
    Holmgren, Fredrik
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Interactive Visual Analysis of Networked Systems: Workflows for Two Industrial Domains2008Report (Other academic)
    Abstract [en]

    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.

  • 13.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Smartare e-handel med intelligenta agenter2000In: Forskning & Framsteg, no 7Article in journal (Other (popular science, discussion, etc.))
  • 14.
    Janson, Sverker
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Programming paradigms of the Andorra Kernel Language1991Report (Other academic)
    Abstract [en]

    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.

  • 15.
    Janson, Sverker
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Rayner, Manny
    RISE, Swedish ICT, SICS.
    Finding out = Achieving Decidability1989Report (Other academic)
    Abstract [en]

    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.

  • 16. La Poutré, Han
    et al.
    Sadeh, Norman M.Janson, SverkerRISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Agent-Mediated Electronic Commerce - Designing Trading Agents and Mechanisms2006Collection (editor) (Refereed)
  • 17.
    Olsson, Tomas
    et al.
    RISE, Swedish ICT, SICS.
    Rasmusson, Andreas
    RISE, Swedish ICT, SICS.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Personalized Decentralized Communication2000Conference paper (Refereed)
    Abstract [en]

    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.

  • 18.
    Rasmusson, Lars
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Agents, self-interest and electronic markets1999In: Knowledge engineering review (Print), ISSN 0269-8889, E-ISSN 1469-8005, Vol. 14, no 2, p. 143-150Article in journal (Refereed)
  • 19.
    Rasmusson, Lars
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Libra, a Multi-hop Radio Network Bandwidth Market2007Conference paper (Refereed)
    Abstract [en]

    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.

  • 20.
    Rayner, Manny
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Epistemic reasoning, logic programming, and the interpretation of questions1987Report (Other academic)
    Abstract [en]

    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.

  • 21. Sadeh, Norman M.
    et al.
    Arunachalam, Raghu
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    TAC-03: a supply-chain trading competition2003In: The AI Magazine, ISSN 0738-4602, Vol. 24, no 1, p. 92-94Article in journal (Refereed)
    Abstract [en]

    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.

1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.8