MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Christos Kaklamanis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 40 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Optimal hypercube simulation on the partitioned optical passive stars network  
  • by Charalampos Konstantopoulos, Christos Kaklamanis — 2007 — Journal of Supercomputing
  • …Partitioned Optimal Passive Stars network, POPS(d, g), is an optical interconnection network of N processors (N = dg) withg 2 optical passive star couplers. In this network, there are g groups of d processors each and the g 2 couplers are used for connecting each group with each of the groups, inclu…
  • Cited by 1 (0 self) – Add To MetaCart
  • Efficient Wavelength Routing on Directed Fiber Trees  
  • by Christos Kaklamanis, Pino Persiano — 1996
  • …. We address the issue of efficiently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We consider directed tree and tree of rings topologies. These are topologies of concrete practical relevance for which undirected underlying graph models …
  • Cited by 24 (11 self) – Add To MetaCart
  • Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors  
  • by Christos Kaklamanis, Giuseppe Persiano — 1992 — Mathematical Systems Theory
  • …In this paper we investigate the parallel complexity of backtrack and branch-and-bound search on the mesh-connected array. We present an \Omega\Gamma p dN= p log N) lower bound for the time needed by a randomized algorithm to perform backtrack and branch-and-bound search of a tree of depth d on …
  • Cited by 22 (0 self) – Add To MetaCart
  • On the Complexity of Wavelength Converters (Extended Abstract)  
  • by V. Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
  • …) Vincenzo Auletta 1 , Ioannis Caragiannis 2 , Christos Kaklamanis 2 , and Pino Persiano 1 1 Dipartimento di Informatica ed Appl. Universit'a di Salerno 84081 Baronissi, Italy fauletta,giuperg@dia.unisa.it 2 Computer Technology Institute Dept. of Computer Engineering and Informatics Unive…
  • Add To MetaCart
  • Approximation Algorithms for Path Coloring in Trees  
  • by Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano — 2001
  • …The study of the path coloring problem is motivated by the allocation of optical bandwidth to communication requests in all-optical networks that utilize Wavelength Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter-receiv…
  • Add To MetaCart
  • New Results for Energy-Efficient Broadcasting in Wireless Networks  
  • by Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos — 2002 — In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC
  • …Abstract. Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node…
  • Cited by 6 (3 self) – Add To MetaCart
  • Wavelength Routing in All-Optical Tree Networks: A Survey  
  • by Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano — 2001 — Computers and Artificial Intelligence
  • …We study the problem of allocating optical bandwidth to sets of communication requests in all--optical networks that utilize Wavelength Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter--receiver paths and assigning wa…
  • Cited by 4 (0 self) – Add To MetaCart
  • Taxes for Linear Atomic Congestion Games  
  • by Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos — 2006 — In Proceedings of the 14th Annual European Symposium on Algorithms (ESA
  • …Abstract. We study congestion games where players aim to access a set of resources. Each player has a set of possible strategies and each resource has a function associating the latency it incurs to the players using it. Players are non–cooperative and each wishes to follow strategies that minimize …
  • Cited by 5 (0 self) – Add To MetaCart
  • Efficient On-line Frequency Allocation and Call Control in Cellular Networks  
  • by Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou — 2002 — Theory Comput. Syst
  • …In this paper we consider communication issues arising in cellular (mobile) networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct freque…
  • Cited by 9 (3 self) – Add To MetaCart
  • Scheduling to maximize participation  
  • by Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou — 2006 — In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), LNCS
  • …Abstract. We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in order to get serviced provided that her latency requirement is met or not to participate in the assignment at …
  • Cited by 2 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB