Results 1  10
of
662,037
On the Minimum Load Coloring Problem
, 2006
"... Given a graph G = (V,E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ: V → {red, blue} is a pair dϕ = (rϕ,bϕ), where rϕ is the number of edges with at least one endvertex colored red and bϕ is the number of edges with at least one endvertex colored blu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Given a graph G = (V,E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ: V → {red, blue} is a pair dϕ = (rϕ,bϕ), where rϕ is the number of edges with at least one endvertex colored red and bϕ is the number of edges with at least one endvertex colored
Maximizing the minimum load for selfish agents
 In Proceedings of the 8th Conference on Latin American Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science
, 2008
"... Abstract. We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the classical load balancing problem, this problem has not been considered for selfish agents until now. For a constant ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the classical load balancing problem, this problem has not been considered for selfish agents until now. For a constant
Maximizing the Minimum Load: The Cost of Selfishness
"... We consider a scheduling problem on m machines, where each job is controlled by a selfish agent. Each agent is only interested in minimizing its own cost, defined as the total load of the machine that its job is assigned to. We consider the objective of maximizing the minimum load (the value of the ..."
Abstract
 Add to MetaCart
We consider a scheduling problem on m machines, where each job is controlled by a selfish agent. Each agent is only interested in minimizing its own cost, defined as the total load of the machine that its job is assigned to. We consider the objective of maximizing the minimum load (the value
Cognitive load during problem solving: effects on learning
 COGNITIVE SCIENCE
, 1988
"... Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problemsolving skill. Evidence that conventional problemsolving activity is not effective in schema acquisition is also accumulating. It is suggested t ..."
Abstract

Cited by 603 (13 self)
 Add to MetaCart
Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problemsolving skill. Evidence that conventional problemsolving activity is not effective in schema acquisition is also accumulating. It is suggested that a major reason for the ineffectiveness of problem solving as a learning device, is that the cognitive processes required by the two activities overlap insufficiently, and that conventional problem solving in the form of meansends analysis requires a relatively large amount of cognitive processing capacity which is consequently unavailable for schema acquisition. A computational model and experimental evidence provide support for this contention. Theoretical and practical implications are discussed.
Approximation Algorithms for MinimumLoad kFacility Location
"... We consider a facilitylocation problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimumload kfacility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C o ..."
Abstract
 Add to MetaCart
We consider a facilitylocation problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimumload kfacility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C
On the Minimum Load Coloring Problem –Extended Abtract–
"... Abstract. Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ: V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ is the number of edges with at least one endvertex colored red and bϕ is the number of edges with at least one endvertex ..."
Abstract
 Add to MetaCart
Abstract. Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ: V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ is the number of edges with at least one endvertex colored red and bϕ is the number of edges with at least one end
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hopcount metric chooses arbitrarily among the different paths of the same minimum length
Energyefficient communication protocol for wireless microsensor networks
, 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract

Cited by 2006 (10 self)
 Add to MetaCart
findings that the conventional protocols of direct transmission, minimumtransmissionenergy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (LowEnergy Adaptive Clustering Hierarchy), a clusteringbased protocol that utilizes randomized rotation of local
Contiki  a Lightweight and Flexible Operating System for Tiny Networked Sensors
, 2004
"... of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs and servi ..."
Abstract

Cited by 497 (43 self)
 Add to MetaCart
of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs
Managing Energy and Server Resources in Hosting Centers
 In Proceedings of the 18th ACM Symposium on Operating System Principles (SOSP
, 2001
"... Interact hosting centers serve multiple service sites from a common hardware base. This paper presents the design and implementation of an architecture for resource management in a hosting center operating system, with an emphasis on energy as a driving resource management issue for large server cl ..."
Abstract

Cited by 558 (37 self)
 Add to MetaCart
clusters. The goals are to provision server resources for cohosted services in a way that automatically adapts to offered load, improve the energy efficiency of server dusters by dynamically resizing the active server set, and respond to power supply disruptions or thermal events by degrading service
Results 1  10
of
662,037