|
Marek Chrobak
Marek Chrobak is a full professor at University of California, Riverside. He is known for his work competitive analysis of online algorithms, particularly for the k-server problem, on information dissemination in ad-hoc radio networks, and on graph drawing. In automata theory, Chrobak is known for his contributions to the study of finite automata over a one-letter alphabet. In particular, "Chrobak normal form" for nondeterministic finite automata is known. Chrobak obtained his PhD in Computer Science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ... from Warsaw University in 1985. References External links * *Bibliography of papers on online algorithms* * * * * Year of birth missing (living people) Living people University of California, Riverside faculty Universi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of California, Riverside
The University of California, Riverside (UCR or UC Riverside) is a public university, public Land-grant university, land-grant research university in Riverside, California, United States. It is one of the ten campuses of the University of California system. The main campus sits on in a suburban district of Riverside with a branch campus of in Palm Desert, California, Palm Desert. In 1907, the predecessor to UCR was founded as the UC Citrus Experiment Station, which conducted research in biological pest control and the use of plant hormone, growth regulators. UCR's undergraduate UCR College of Humanities, Arts, and Social Sciences, College of Letters and Science opened in 1954. The Regents of the University of California declared UCR a general campus of the system in 1959, and graduate students were admitted in 1961. To accommodate an enrollment of 21,000 students by 2015, more than $730 million has been invested in new construction projects since 1999. UCR plans to have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Competitive Analysis (online Algorithm)
Competitive analysis is a method invented for analyzing online algorithms, in which the performance of an online algorithm (which must satisfy an unpredictable sequence of requests, completing each request without being able to see the future) is compared to the performance of an optimal ''offline algorithm'' that can view the sequence of requests in advance. An algorithm is ''competitive'' if its ''competitive ratio''—the ratio between its performance and the offline algorithm's performance—is bounded. Unlike traditional worst-case analysis, where the performance of an algorithm is measured only for "hard" inputs, competitive analysis requires that an algorithm perform well both on hard and easy inputs, where "hard" and "easy" are defined by the performance of the optimal offline algorithm. For many algorithms, performance is dependent not only on the size of the inputs, but also on their values. For example, sorting an array of elements varies in difficulty depending on th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Online Algorithm
In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed to the algorithm, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand. In operations research Operations research () (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a branch of applied mathematics that deals with the development and application of analytical methods to improve management and ..., the area in which online algorithms are developed is called online optimization. As an example, consider the sorting algorithms selection sort and insertion sort: selection sort repeatedly selects the minimum element from the unsorted remainder and places it at the front, which requires access to the entire input; it is thus a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
K-server Problem
The -server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are central to the theory of competitive analysis (the other being metrical task systems). In this problem, an online algorithm must control the movement of a set of ''k'' ''servers'', represented as points in a metric space, and handle ''requests'' that are also in the form of points in the space. As each request arrives, the algorithm must determine which server to move to the requested point. The goal of the algorithm is to keep the total distance all servers move small, relative to the total distance the servers could have moved by an optimal adversary who knows in advance the entire sequence of requests. The problem was first posed by Mark Manasse, Lyle A. McGeoch and Daniel Sleator (1988). The most prominent open question concerning the ''k''-server problem is the so-called ''k''-server conjecture, also posed by Manasse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical logic. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nondeterministic Finite Automata
In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if * each of its transitions is ''uniquely'' determined by its source state and input symbol, and * reading an input symbol is required for each state transition. A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need to obey these restrictions. In particular, every DFA is also an NFA. Sometimes the term NFA is used in a narrower sense, referring to an NFA that is ''not'' a DFA, but not in this article. Using the subset construction algorithm, each NFA can be translated to an equivalent DFA; i.e., a DFA recognizing the same formal language. Like DFAs, NFAs only recognize regular languages. NFAs were introduced in 1959 by Michael O. Rabin and Dana Scott, who also showed their equivalence to DFAs. NFAs are used in the implementation of regular expressions: Thompson's construction is an algorithm for compiling a regular expression to an NFA that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Warsaw University
The University of Warsaw (, ) is a public research university in Warsaw, Poland. Established on November 19, 1816, it is the largest institution of higher learning in the country, offering 37 different fields of study as well as 100 specializations in humanities, technical, and natural sciences. The University of Warsaw consists of 126 buildings and educational complexes with over 18 faculties: biology, chemistry, medicine, journalism, political science, philosophy, sociology, physics, geography, regional studies, geology, history, applied linguistics, philology, Polish language, pedagogy, economics, law, public administration, psychology, applied social sciences, management, mathematics, computer science, and mechanics. Among the university's notable alumni are heads of state, prime ministers, Nobel Prize laureates, including Sir Joseph Rotblat and Olga Tokarczuk, as well as several historically important individuals in their respective fields, such as Frédéric Chopin, Hil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year is a unit of time based on how long it takes the Earth to orbit the Sun. In scientific use, the tropical year (approximately 365 solar days, 5 hours, 48 minutes, 45 seconds) and the sidereal year (about 20 minutes longer) are more exact. The modern calendar year, as reckoned according to the Gregorian calendar, approximates the tropical year by using a system of leap years. The term 'year' is also used to indicate other periods of roughly similar duration, such as the lunar year (a roughly 354-day cycle of twelve of the Moon's phasessee lunar calendar), as well as periods loosely associated with the calendar or astronomical year, such as the seasonal year, the fiscal year, the academic year, etc. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by changes in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Purpose: Because living persons may suffer personal harm from inappropriate information, we should watch their articles carefully. By adding an article to this category, it marks them with a notice about sources whenever someone tries to edit them, to remind them of WP:BLP (biographies of living persons) policy that these articles must maintain a neutral point of view, maintain factual accuracy, and be properly sourced. Recent changes to these articles are listed on Special:RecentChangesLinked/Living people. Organization: This category should not be sub-categorized. Entries are generally sorted by family name In many societies, a surname, family name, or last name is the mostly hereditary portion of one's personal name that indicates one's family. It is typically combined with a given name to form the full name of a person, although several give .... Maintenance: Individuals of advanced age (over 90), for whom there has been no new documentation in the last ten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of California, Riverside Faculty
A university () is an institution of tertiary education and research which awards academic degrees in several academic disciplines. ''University'' is derived from the Latin phrase , which roughly means "community of teachers and scholars". Universities typically offer both undergraduate and postgraduate programs. The first universities in Europe were established by Catholic monks. The University of Bologna (), Italy, which was founded in 1088, is the first university in the sense of: *being a high degree-awarding institute. *using the word (which was coined at its foundation). *having independence from the ecclesiastic schools and issuing secular as well as non-secular degrees (with teaching conducted by both clergy and non-clergy): grammar, rhetoric, logic, theology, canon law and notarial law.Hunt Janin: "The university in medieval life, 1179–1499", McFarland, 2008, , p. 55f.de Ridder-Symoens, Hilde''A History of the University in Europe: Volume 1, Universities in the Midd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
